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/20170319-ConjunctivePathPrograms/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:16:42,436 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:16:42,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:16:42,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:16:42,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:16:42,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:16:42,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:16:42,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:16:42,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:16:42,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:16:42,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:16:42,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:16:42,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:16:42,462 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:16:42,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:16:42,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:16:42,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:16:42,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:16:42,469 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:16:42,470 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:16:42,472 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:16:42,473 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:16:42,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:16:42,476 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:16:42,476 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:16:42,477 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:16:42,478 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:16:42,478 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:16:42,479 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:16:42,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:16:42,481 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:16:42,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:16:42,482 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:16:42,482 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:16:42,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:16:42,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:16:42,484 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:16:42,493 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:16:42,493 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:16:42,494 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:16:42,494 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:16:42,495 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:16:42,495 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:16:42,495 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:16:42,495 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:16:42,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:16:42,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:16:42,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:16:42,563 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:16:42,564 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:16:42,564 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-07-25 13:16:42,565 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl' [2018-07-25 13:16:42,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:16:42,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:16:42,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:16:42,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:16:42,623 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:16:42,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:42" (1/1) ... [2018-07-25 13:16:42,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:42" (1/1) ... [2018-07-25 13:16:42,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:16:42,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:16:42,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:16:42,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:16:42,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:42" (1/1) ... [2018-07-25 13:16:42,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:42" (1/1) ... [2018-07-25 13:16:42,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:42" (1/1) ... [2018-07-25 13:16:42,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:42" (1/1) ... [2018-07-25 13:16:42,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:42" (1/1) ... [2018-07-25 13:16:42,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:42" (1/1) ... [2018-07-25 13:16:42,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:42" (1/1) ... [2018-07-25 13:16:42,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:16:42,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:16:42,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:16:42,690 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:16:42,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:42" (1/1) ... [2018-07-25 13:16:42,774 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-07-25 13:16:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:16:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:16:42,883 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:16:42,884 INFO L202 PluginConnector]: Adding new model count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:16:42 BoogieIcfgContainer [2018-07-25 13:16:42,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:16:42,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:16:42,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:16:42,889 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:16:42,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:42" (1/2) ... [2018-07-25 13:16:42,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fac595 and model type count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:16:42, skipping insertion in model container [2018-07-25 13:16:42,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:16:42" (2/2) ... [2018-07-25 13:16:42,893 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-07-25 13:16:42,904 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:16:42,912 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:16:42,963 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:16:42,964 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:16:42,965 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:16:42,965 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:16:42,965 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:16:42,965 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:16:42,966 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:16:42,966 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:16:42,966 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:16:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-25 13:16:42,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:16:42,996 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:42,998 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:16:42,999 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-07-25 13:16:43,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,075 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:16:43,078 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:43,078 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:16:43,083 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:16:43,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:16:43,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:16:43,099 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-25 13:16:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:43,122 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-07-25 13:16:43,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:16:43,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 13:16:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:43,136 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:16:43,136 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 13:16:43,139 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:16:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 13:16:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 13:16:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 13:16:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 13:16:43,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 13:16:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:43,178 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 13:16:43,178 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:16:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 13:16:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:16:43,179 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:43,179 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:16:43,180 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,180 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-07-25 13:16:43,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:43,201 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,201 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:16:43,203 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:16:43,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:16:43,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:16:43,204 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 13:16:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:43,223 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 13:16:43,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:16:43,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 13:16:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:43,225 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:16:43,226 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 13:16:43,227 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:16:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 13:16:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 13:16:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:16:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:16:43,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 13:16:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:43,232 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:16:43,233 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:16:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:16:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:16:43,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:43,234 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 13:16:43,234 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2018-07-25 13:16:43,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:43,279 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:16:43,279 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:16:43,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:16:43,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:16:43,280 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 13:16:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:43,293 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:16:43,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:16:43,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 13:16:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:43,294 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:16:43,294 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:16:43,295 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:16:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:16:43,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:16:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:16:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:16:43,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 13:16:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:43,298 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:16:43,298 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:16:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:16:43,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:43,299 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:43,299 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 13:16:43,299 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,300 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2018-07-25 13:16:43,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,330 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:16:43,331 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,331 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:16:43,331 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:16:43,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:16:43,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:16:43,332 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 13:16:43,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:43,346 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:16:43,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:16:43,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:16:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:43,348 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:16:43,348 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:16:43,349 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:16:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:16:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 13:16:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:16:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:16:43,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 13:16:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:43,353 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:16:43,353 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:16:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:16:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:43,354 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:43,354 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 13:16:43,354 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2018-07-25 13:16:43,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:43,414 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,415 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:43,415 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:43,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:43,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:43,416 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 13:16:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:43,440 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:16:43,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:16:43,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 13:16:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:43,443 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:16:43,444 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:16:43,444 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:16:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:16:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:16:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:16:43,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 13:16:43,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:43,450 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:16:43,450 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:43,451 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:16:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:16:43,452 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:43,453 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 13:16:43,454 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2018-07-25 13:16:43,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:43,542 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,542 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:43,543 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:43,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:43,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:43,547 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 13:16:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:43,573 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:16:43,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:16:43,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:16:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:43,577 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:16:43,577 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:16:43,578 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:16:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 13:16:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:16:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:16:43,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 13:16:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:43,586 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:16:43,586 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:16:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:16:43,587 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:43,587 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 13:16:43,587 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2018-07-25 13:16:43,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:43,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,636 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:43,636 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:43,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:43,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:43,637 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 13:16:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:43,651 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:16:43,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:16:43,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 13:16:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:43,653 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:16:43,653 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:16:43,653 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:16:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:16:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:16:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:16:43,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 13:16:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:43,657 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:16:43,657 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:16:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:43,658 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:43,658 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 13:16:43,658 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2018-07-25 13:16:43,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:43,700 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,700 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:43,701 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:43,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:43,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:43,702 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 13:16:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:43,725 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:16:43,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:43,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 13:16:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:43,726 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:16:43,726 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 13:16:43,727 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:43,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 13:16:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 13:16:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:16:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:16:43,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 13:16:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:43,731 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:16:43,731 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:16:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:43,731 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:43,732 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 13:16:43,732 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,732 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2018-07-25 13:16:43,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:43,782 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,782 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:43,783 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:43,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:43,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:43,784 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 13:16:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:43,819 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:16:43,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:43,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 13:16:43,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:43,820 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:16:43,821 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:16:43,821 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:16:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:16:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:16:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:16:43,828 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 13:16:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:43,828 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:16:43,828 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:16:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:16:43,829 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:43,829 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 13:16:43,834 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2018-07-25 13:16:43,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,916 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:43,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:43,917 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:43,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:43,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:43,918 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 13:16:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:43,933 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 13:16:43,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:43,934 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 13:16:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:43,935 INFO L225 Difference]: With dead ends: 16 [2018-07-25 13:16:43,935 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 13:16:43,935 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:43,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 13:16:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 13:16:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 13:16:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 13:16:43,939 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 13:16:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:43,940 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 13:16:43,940 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 13:16:43,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:43,941 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:43,941 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 13:16:43,941 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2018-07-25 13:16:43,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:43,996 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,996 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:16:43,997 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:16:43,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:16:43,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:43,998 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-25 13:16:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,016 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:16:44,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:44,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-25 13:16:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,017 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:16:44,017 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:16:44,018 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:16:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:16:44,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:16:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:16:44,029 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 13:16:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,030 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:16:44,030 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:16:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:16:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:16:44,031 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,031 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 13:16:44,031 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2018-07-25 13:16:44,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:44,106 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:44,106 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:16:44,106 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:16:44,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:16:44,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:44,107 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-25 13:16:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,133 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 13:16:44,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:44,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-25 13:16:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,134 INFO L225 Difference]: With dead ends: 18 [2018-07-25 13:16:44,135 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:16:44,136 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:16:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 13:16:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:16:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 13:16:44,144 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 13:16:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,144 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 13:16:44,144 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:16:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 13:16:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:44,147 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,147 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-25 13:16:44,148 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2018-07-25 13:16:44,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:44,218 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:44,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:16:44,219 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:16:44,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:16:44,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:44,220 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-25 13:16:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,241 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:16:44,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:44,242 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-25 13:16:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,243 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:16:44,243 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:16:44,243 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:16:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:16:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:16:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:16:44,252 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 13:16:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,253 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:16:44,253 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:16:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:16:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:44,254 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,254 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-25 13:16:44,254 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2018-07-25 13:16:44,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:44,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:44,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:16:44,313 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:16:44,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:16:44,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:44,314 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-25 13:16:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,328 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 13:16:44,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:16:44,329 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-25 13:16:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,329 INFO L225 Difference]: With dead ends: 20 [2018-07-25 13:16:44,330 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 13:16:44,330 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 13:16:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 13:16:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 13:16:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 13:16:44,334 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 13:16:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,335 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 13:16:44,335 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:16:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 13:16:44,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:16:44,336 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,336 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-25 13:16:44,336 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,337 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2018-07-25 13:16:44,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:44,386 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:44,386 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:16:44,387 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:16:44,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:16:44,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:44,388 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-25 13:16:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,403 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:16:44,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:44,404 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-25 13:16:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,404 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:16:44,404 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:16:44,405 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:16:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:16:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:16:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:16:44,413 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 13:16:44,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,413 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:16:44,414 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:16:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:16:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:44,415 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,415 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-25 13:16:44,415 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2018-07-25 13:16:44,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:44,471 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:44,471 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:16:44,471 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:16:44,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:16:44,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:44,473 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-25 13:16:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,488 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 13:16:44,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:16:44,489 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-25 13:16:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,489 INFO L225 Difference]: With dead ends: 22 [2018-07-25 13:16:44,490 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 13:16:44,490 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 13:16:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 13:16:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 13:16:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 13:16:44,495 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 13:16:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,495 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 13:16:44,495 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:16:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 13:16:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:16:44,496 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,497 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-25 13:16:44,497 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2018-07-25 13:16:44,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:44,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:44,562 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:16:44,562 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:16:44,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:16:44,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:44,565 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-07-25 13:16:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,579 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:16:44,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:16:44,582 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-25 13:16:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,582 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:16:44,583 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:16:44,584 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:16:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:16:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:16:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:16:44,588 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 13:16:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,588 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:16:44,589 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:16:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:16:44,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:16:44,591 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,591 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-25 13:16:44,591 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2018-07-25 13:16:44,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:44,670 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:44,671 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:16:44,671 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:16:44,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:16:44,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:16:44,676 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-07-25 13:16:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,702 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 13:16:44,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:16:44,702 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-25 13:16:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,703 INFO L225 Difference]: With dead ends: 24 [2018-07-25 13:16:44,703 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 13:16:44,705 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:16:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 13:16:44,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 13:16:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 13:16:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 13:16:44,711 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 13:16:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,714 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 13:16:44,715 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:16:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 13:16:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:16:44,716 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,716 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-25 13:16:44,716 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2018-07-25 13:16:44,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:44,786 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:44,787 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:16:44,787 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:16:44,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:16:44,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:44,788 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-07-25 13:16:44,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,804 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:16:44,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:16:44,805 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-25 13:16:44,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,806 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:16:44,806 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:16:44,807 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:44,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:16:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:16:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:16:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:16:44,816 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 13:16:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,816 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:16:44,817 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:16:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:16:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:16:44,818 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,818 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-25 13:16:44,819 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2018-07-25 13:16:44,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:44,889 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:44,889 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:16:44,890 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:16:44,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:16:44,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:16:44,891 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-07-25 13:16:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,916 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 13:16:44,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:16:44,916 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-25 13:16:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,917 INFO L225 Difference]: With dead ends: 26 [2018-07-25 13:16:44,917 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 13:16:44,918 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:16:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 13:16:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 13:16:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 13:16:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 13:16:44,926 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 13:16:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,926 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 13:16:44,926 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:16:44,926 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 13:16:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:16:44,927 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,927 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-25 13:16:44,928 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,928 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2018-07-25 13:16:44,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:45,005 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:16:45,006 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:45,006 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:16:45,007 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:16:45,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:16:45,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:16:45,010 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-07-25 13:16:45,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:45,034 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:16:45,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:16:45,035 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-25 13:16:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:45,035 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:16:45,036 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:16:45,039 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:16:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:16:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:16:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:16:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:16:45,045 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 13:16:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:45,046 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:16:45,046 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:16:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:16:45,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:16:45,047 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:45,047 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-25 13:16:45,047 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:45,049 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2018-07-25 13:16:45,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:45,141 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:45,141 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:16:45,141 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:16:45,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:16:45,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:16:45,143 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-07-25 13:16:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:45,163 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 13:16:45,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:16:45,164 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-25 13:16:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:45,164 INFO L225 Difference]: With dead ends: 28 [2018-07-25 13:16:45,165 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 13:16:45,175 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:16:45,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 13:16:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 13:16:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 13:16:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 13:16:45,182 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 13:16:45,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:45,183 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 13:16:45,183 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:16:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 13:16:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:16:45,184 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:45,185 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-25 13:16:45,185 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:45,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2018-07-25 13:16:45,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:45,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:45,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:16:45,281 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:16:45,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:16:45,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:16:45,282 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-07-25 13:16:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:45,308 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:16:45,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:16:45,309 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-25 13:16:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:45,309 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:16:45,310 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:16:45,310 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:16:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:16:45,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:16:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:16:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:16:45,316 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 13:16:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:45,317 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:16:45,318 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:16:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:16:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:16:45,318 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:45,319 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-25 13:16:45,319 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:45,319 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2018-07-25 13:16:45,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:45,414 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:45,414 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:16:45,415 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:16:45,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:16:45,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:16:45,416 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-07-25 13:16:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:45,437 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 13:16:45,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:16:45,438 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-25 13:16:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:45,438 INFO L225 Difference]: With dead ends: 30 [2018-07-25 13:16:45,439 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 13:16:45,439 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:16:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 13:16:45,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 13:16:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 13:16:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 13:16:45,449 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 13:16:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:45,450 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 13:16:45,450 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:16:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 13:16:45,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 13:16:45,451 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:45,451 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-25 13:16:45,455 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2018-07-25 13:16:45,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:45,563 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:45,563 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:16:45,563 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:16:45,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:16:45,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:16:45,565 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-07-25 13:16:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:45,581 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:16:45,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:16:45,582 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-25 13:16:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:45,584 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:16:45,584 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:16:45,585 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:16:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:16:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:16:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:16:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:16:45,590 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 13:16:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:45,590 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:16:45,591 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:16:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:16:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:16:45,592 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:45,592 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-25 13:16:45,592 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:45,592 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2018-07-25 13:16:45,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:45,704 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:45,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:16:45,705 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:16:45,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:16:45,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:16:45,706 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-07-25 13:16:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:45,727 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 13:16:45,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:16:45,728 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-25 13:16:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:45,729 INFO L225 Difference]: With dead ends: 32 [2018-07-25 13:16:45,729 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 13:16:45,730 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:16:45,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 13:16:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 13:16:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 13:16:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 13:16:45,733 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 13:16:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:45,734 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 13:16:45,734 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:16:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 13:16:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 13:16:45,735 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:45,735 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-25 13:16:45,735 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:45,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2018-07-25 13:16:45,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:45,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:45,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:16:45,846 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:16:45,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:16:45,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:16:45,847 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-07-25 13:16:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:45,878 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:16:45,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:16:45,878 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-25 13:16:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:45,879 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:16:45,879 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:16:45,880 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:16:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:16:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:16:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:16:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:16:45,884 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 13:16:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:45,885 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:16:45,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:16:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:16:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:16:45,886 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:45,886 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-25 13:16:45,887 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:45,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2018-07-25 13:16:45,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:46,000 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:46,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:16:46,001 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:16:46,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:16:46,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:16:46,002 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-07-25 13:16:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:46,026 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 13:16:46,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:16:46,026 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-25 13:16:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:46,027 INFO L225 Difference]: With dead ends: 34 [2018-07-25 13:16:46,027 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 13:16:46,028 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:16:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 13:16:46,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 13:16:46,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 13:16:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 13:16:46,039 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 13:16:46,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:46,039 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 13:16:46,039 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:16:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 13:16:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 13:16:46,042 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:46,042 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-25 13:16:46,043 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2018-07-25 13:16:46,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:46,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:46,174 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:16:46,174 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:16:46,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:16:46,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:16:46,175 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-07-25 13:16:46,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:46,200 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:16:46,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:16:46,201 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-25 13:16:46,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:46,202 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:16:46,202 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:16:46,203 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:16:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:16:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:16:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:16:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:16:46,213 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 13:16:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:46,213 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:16:46,214 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:16:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:16:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:16:46,214 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:46,215 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-25 13:16:46,215 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:46,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2018-07-25 13:16:46,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:46,348 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:46,348 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:16:46,349 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:16:46,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:16:46,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:16:46,350 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-07-25 13:16:46,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:46,377 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 13:16:46,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:16:46,377 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-25 13:16:46,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:46,378 INFO L225 Difference]: With dead ends: 36 [2018-07-25 13:16:46,378 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 13:16:46,379 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:16:46,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 13:16:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 13:16:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 13:16:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 13:16:46,384 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 13:16:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:46,385 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 13:16:46,385 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:16:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 13:16:46,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 13:16:46,385 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:46,386 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-25 13:16:46,386 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:46,386 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2018-07-25 13:16:46,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:46,522 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:46,522 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:16:46,522 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:16:46,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:16:46,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:16:46,524 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-07-25 13:16:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:46,543 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:16:46,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:16:46,544 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-25 13:16:46,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:46,544 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:16:46,544 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:16:46,546 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:16:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:16:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:16:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:16:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:16:46,550 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 13:16:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:46,551 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:16:46,551 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:16:46,551 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:16:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:16:46,551 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:46,552 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-25 13:16:46,552 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:46,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2018-07-25 13:16:46,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:46,693 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:46,693 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:16:46,694 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:16:46,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:16:46,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:16:46,696 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-07-25 13:16:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:46,714 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 13:16:46,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:16:46,714 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-25 13:16:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:46,715 INFO L225 Difference]: With dead ends: 38 [2018-07-25 13:16:46,715 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 13:16:46,716 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:16:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 13:16:46,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 13:16:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 13:16:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 13:16:46,724 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 13:16:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:46,724 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 13:16:46,725 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:16:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 13:16:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 13:16:46,725 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:46,731 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-25 13:16:46,731 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2018-07-25 13:16:46,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:46,907 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:46,907 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:16:46,907 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:16:46,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:16:46,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:16:46,912 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-07-25 13:16:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:46,969 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:16:46,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:16:46,970 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-25 13:16:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:46,970 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:16:46,970 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:16:46,971 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:16:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:16:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:16:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:16:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:16:46,974 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 13:16:46,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:46,974 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:16:46,975 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:16:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:16:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:16:46,975 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:46,975 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-25 13:16:46,976 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:46,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2018-07-25 13:16:46,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:47,101 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:47,101 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:16:47,102 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:16:47,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:16:47,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:16:47,103 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-07-25 13:16:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:47,138 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 13:16:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:16:47,139 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-25 13:16:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:47,139 INFO L225 Difference]: With dead ends: 40 [2018-07-25 13:16:47,139 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 13:16:47,140 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:16:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 13:16:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 13:16:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 13:16:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 13:16:47,143 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 13:16:47,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:47,143 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 13:16:47,143 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:16:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 13:16:47,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 13:16:47,144 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:47,144 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-25 13:16:47,144 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2018-07-25 13:16:47,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:47,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:47,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:16:47,277 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:16:47,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:16:47,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:16:47,278 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-07-25 13:16:47,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:47,316 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:16:47,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:16:47,316 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-25 13:16:47,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:47,317 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:16:47,317 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:16:47,318 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:16:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:16:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:16:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:16:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:16:47,320 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 13:16:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:47,321 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:16:47,321 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:16:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:16:47,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:16:47,321 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:47,321 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-25 13:16:47,322 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:47,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2018-07-25 13:16:47,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:47,463 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:47,464 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:16:47,464 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:16:47,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:16:47,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:16:47,465 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-07-25 13:16:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:47,486 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 13:16:47,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:16:47,486 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-25 13:16:47,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:47,486 INFO L225 Difference]: With dead ends: 42 [2018-07-25 13:16:47,487 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 13:16:47,488 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:16:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 13:16:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 13:16:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 13:16:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 13:16:47,490 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 13:16:47,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:47,490 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 13:16:47,491 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:16:47,491 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 13:16:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 13:16:47,491 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:47,492 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-25 13:16:47,492 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:47,492 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2018-07-25 13:16:47,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:47,638 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:47,638 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:16:47,638 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:16:47,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:16:47,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:16:47,640 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-07-25 13:16:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:47,657 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:16:47,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:16:47,657 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-25 13:16:47,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:47,658 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:16:47,658 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:16:47,659 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:16:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:16:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:16:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:16:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:16:47,662 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 13:16:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:47,662 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:16:47,662 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:16:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:16:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:16:47,663 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:47,663 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-25 13:16:47,663 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:47,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2018-07-25 13:16:47,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:47,810 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:47,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:16:47,811 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:16:47,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:16:47,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:16:47,812 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-07-25 13:16:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:47,833 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 13:16:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:16:47,833 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-25 13:16:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:47,834 INFO L225 Difference]: With dead ends: 44 [2018-07-25 13:16:47,834 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 13:16:47,836 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:16:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 13:16:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 13:16:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 13:16:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 13:16:47,839 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 13:16:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:47,840 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 13:16:47,840 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:16:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 13:16:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 13:16:47,840 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:47,840 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-25 13:16:47,841 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:47,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2018-07-25 13:16:47,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:47,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:47,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:16:47,995 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:16:47,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:16:47,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:16:47,997 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-07-25 13:16:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:48,022 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:16:48,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:16:48,023 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-25 13:16:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:48,024 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:16:48,024 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:16:48,025 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:16:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:16:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:16:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:16:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:16:48,027 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 13:16:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:48,028 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:16:48,028 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:16:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:16:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:16:48,029 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:48,029 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-25 13:16:48,029 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:48,029 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2018-07-25 13:16:48,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:48,184 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:48,184 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:16:48,185 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:16:48,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:16:48,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:16:48,186 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-07-25 13:16:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:48,205 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 13:16:48,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:16:48,206 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-25 13:16:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:48,206 INFO L225 Difference]: With dead ends: 46 [2018-07-25 13:16:48,206 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 13:16:48,207 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:16:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 13:16:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 13:16:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 13:16:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 13:16:48,210 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 13:16:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:48,210 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 13:16:48,210 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:16:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 13:16:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 13:16:48,211 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:48,211 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-25 13:16:48,211 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:48,212 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2018-07-25 13:16:48,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:48,369 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:48,369 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:16:48,369 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:16:48,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:16:48,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:16:48,371 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-07-25 13:16:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:48,394 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:16:48,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:16:48,394 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-25 13:16:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:48,395 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:16:48,395 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:16:48,396 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:16:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:16:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:16:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:16:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:16:48,399 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 13:16:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:48,399 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:16:48,399 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:16:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:16:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:16:48,400 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:48,400 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-25 13:16:48,400 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:48,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2018-07-25 13:16:48,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:48,563 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:48,563 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:48,564 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:16:48,564 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:16:48,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:16:48,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:16:48,566 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-07-25 13:16:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:48,585 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 13:16:48,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:16:48,586 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-25 13:16:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:48,586 INFO L225 Difference]: With dead ends: 48 [2018-07-25 13:16:48,586 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 13:16:48,588 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:16:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 13:16:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 13:16:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 13:16:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 13:16:48,590 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 13:16:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:48,591 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 13:16:48,591 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:16:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 13:16:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 13:16:48,592 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:48,592 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-25 13:16:48,592 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:48,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2018-07-25 13:16:48,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:48,759 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:48,759 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:16:48,759 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:16:48,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:16:48,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:16:48,761 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-07-25 13:16:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:48,787 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:16:48,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:16:48,787 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-25 13:16:48,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:48,788 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:16:48,788 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:16:48,789 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:16:48,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:16:48,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:16:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:16:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:16:48,792 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 13:16:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:48,792 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:16:48,792 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:16:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:16:48,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:16:48,793 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:48,793 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-25 13:16:48,793 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:48,793 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2018-07-25 13:16:48,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:48,965 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:48,965 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:16:48,965 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:16:48,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:16:48,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:16:48,967 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-07-25 13:16:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:48,991 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 13:16:48,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:16:48,992 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-25 13:16:48,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:48,992 INFO L225 Difference]: With dead ends: 50 [2018-07-25 13:16:48,993 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 13:16:48,994 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:16:48,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 13:16:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 13:16:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 13:16:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 13:16:48,996 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 13:16:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:48,996 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 13:16:48,997 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:16:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 13:16:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 13:16:48,997 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:48,997 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-25 13:16:48,997 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:48,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2018-07-25 13:16:48,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:49,189 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:49,189 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:16:49,189 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:16:49,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:16:49,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:16:49,191 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-07-25 13:16:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:49,212 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:16:49,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:16:49,213 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-25 13:16:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:49,213 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:16:49,214 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:16:49,214 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:16:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:16:49,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:16:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:16:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:16:49,217 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 13:16:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:49,218 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:16:49,218 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:16:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:16:49,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:16:49,218 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:49,219 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-25 13:16:49,219 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:49,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2018-07-25 13:16:49,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:49,429 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:49,429 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:16:49,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:16:49,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:16:49,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:16:49,431 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-07-25 13:16:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:49,454 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 13:16:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:16:49,454 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-25 13:16:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:49,455 INFO L225 Difference]: With dead ends: 52 [2018-07-25 13:16:49,455 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 13:16:49,456 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:16:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 13:16:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 13:16:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 13:16:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 13:16:49,459 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 13:16:49,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:49,459 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 13:16:49,459 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:16:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 13:16:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 13:16:49,460 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:49,460 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-25 13:16:49,460 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:49,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2018-07-25 13:16:49,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:49,711 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:49,711 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:16:49,712 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:16:49,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:16:49,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:16:49,713 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-07-25 13:16:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:49,736 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:16:49,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:16:49,736 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-25 13:16:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:49,737 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:16:49,737 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:16:49,738 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:16:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:16:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:16:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:16:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:16:49,740 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 13:16:49,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:49,741 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:16:49,741 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:16:49,741 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:16:49,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:16:49,741 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:49,742 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-25 13:16:49,742 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:49,742 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2018-07-25 13:16:49,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:49,953 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:49,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:16:49,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:16:49,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:16:49,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:16:49,955 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-07-25 13:16:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:49,977 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 13:16:49,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:16:49,978 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-25 13:16:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:49,978 INFO L225 Difference]: With dead ends: 54 [2018-07-25 13:16:49,978 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 13:16:49,981 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:16:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 13:16:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 13:16:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 13:16:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 13:16:49,983 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 13:16:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:49,984 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 13:16:49,984 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:16:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 13:16:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 13:16:49,984 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:49,984 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-25 13:16:49,985 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:49,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2018-07-25 13:16:49,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:50,190 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:50,190 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:16:50,190 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:16:50,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:16:50,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:16:50,192 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-07-25 13:16:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:50,217 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:16:50,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:16:50,218 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-25 13:16:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:50,218 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:16:50,218 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:16:50,219 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:16:50,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:16:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:16:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:16:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:16:50,223 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 13:16:50,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:50,223 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:16:50,223 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:16:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:16:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:16:50,224 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:50,224 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-25 13:16:50,224 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:50,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2018-07-25 13:16:50,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:50,417 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:50,417 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:16:50,418 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:16:50,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:16:50,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:16:50,419 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-07-25 13:16:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:50,446 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 13:16:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:16:50,446 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-25 13:16:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:50,447 INFO L225 Difference]: With dead ends: 56 [2018-07-25 13:16:50,447 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 13:16:50,448 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:16:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 13:16:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 13:16:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 13:16:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 13:16:50,450 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 13:16:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:50,451 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 13:16:50,451 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:16:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 13:16:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 13:16:50,451 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:50,452 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-25 13:16:50,452 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:50,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2018-07-25 13:16:50,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:50,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:50,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:16:50,646 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:16:50,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:16:50,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:16:50,649 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-07-25 13:16:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:50,687 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:16:50,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:16:50,687 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-25 13:16:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:50,688 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:16:50,688 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:16:50,689 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:16:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:16:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:16:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:16:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:16:50,697 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 13:16:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:50,698 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:16:50,698 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:16:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:16:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:16:50,698 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:50,698 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-25 13:16:50,699 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:50,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2018-07-25 13:16:50,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:50,893 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:50,893 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:16:50,893 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:16:50,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:16:50,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:16:50,895 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-07-25 13:16:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:50,920 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 13:16:50,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:16:50,921 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-25 13:16:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:50,921 INFO L225 Difference]: With dead ends: 58 [2018-07-25 13:16:50,922 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 13:16:50,923 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:16:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 13:16:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 13:16:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 13:16:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 13:16:50,925 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 13:16:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:50,926 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 13:16:50,926 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:16:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 13:16:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 13:16:50,926 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:50,926 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-25 13:16:50,927 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:50,927 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2018-07-25 13:16:50,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:51,132 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:51,132 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:16:51,132 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:16:51,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:16:51,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:16:51,134 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-07-25 13:16:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:51,161 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:16:51,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:16:51,162 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-25 13:16:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:51,162 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:16:51,162 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:16:51,163 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:16:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:16:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:16:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:16:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:16:51,166 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 13:16:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:51,166 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:16:51,166 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:16:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:16:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:16:51,167 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:51,167 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-25 13:16:51,167 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2018-07-25 13:16:51,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:51,396 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:51,396 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:16:51,397 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:16:51,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:16:51,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:16:51,399 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-07-25 13:16:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:51,438 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 13:16:51,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:16:51,438 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-25 13:16:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:51,439 INFO L225 Difference]: With dead ends: 60 [2018-07-25 13:16:51,439 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 13:16:51,441 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:16:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 13:16:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 13:16:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 13:16:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 13:16:51,444 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 13:16:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:51,444 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 13:16:51,444 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:16:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 13:16:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 13:16:51,445 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:51,445 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-25 13:16:51,447 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:51,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2018-07-25 13:16:51,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:51,686 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:51,686 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:16:51,687 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:16:51,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:16:51,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:16:51,688 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-07-25 13:16:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:51,726 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:16:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:16:51,727 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-25 13:16:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:51,728 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:16:51,728 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:16:51,729 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:16:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:16:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:16:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:16:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:16:51,732 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 13:16:51,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:51,732 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:16:51,732 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:16:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:16:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:16:51,733 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:51,733 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-25 13:16:51,733 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:51,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2018-07-25 13:16:51,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:52,018 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:52,019 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:16:52,019 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:16:52,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:16:52,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:16:52,021 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-07-25 13:16:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:52,048 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 13:16:52,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:16:52,048 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-25 13:16:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:52,049 INFO L225 Difference]: With dead ends: 62 [2018-07-25 13:16:52,049 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 13:16:52,051 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:16:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 13:16:52,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 13:16:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 13:16:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 13:16:52,054 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 13:16:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:52,054 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 13:16:52,054 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:16:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 13:16:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 13:16:52,055 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:52,055 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-25 13:16:52,055 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:52,056 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2018-07-25 13:16:52,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:52,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:52,369 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:52,370 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:16:52,370 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:16:52,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:16:52,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:16:52,372 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-07-25 13:16:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:52,414 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:16:52,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:16:52,414 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-25 13:16:52,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:52,415 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:16:52,415 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:16:52,416 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:16:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:16:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:16:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:16:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:16:52,421 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 13:16:52,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:52,422 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:16:52,422 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:16:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:16:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:16:52,422 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:52,423 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-25 13:16:52,423 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:52,423 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2018-07-25 13:16:52,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:52,658 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:52,658 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:16:52,659 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:16:52,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:16:52,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:16:52,660 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-07-25 13:16:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:52,705 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 13:16:52,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:16:52,705 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-25 13:16:52,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:52,706 INFO L225 Difference]: With dead ends: 64 [2018-07-25 13:16:52,706 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 13:16:52,707 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:16:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 13:16:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 13:16:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 13:16:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 13:16:52,710 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 13:16:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:52,710 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 13:16:52,710 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:16:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 13:16:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 13:16:52,711 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:52,711 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-25 13:16:52,711 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2018-07-25 13:16:52,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:52,966 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:52,966 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:16:52,967 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:16:52,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:16:52,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:16:52,968 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-07-25 13:16:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:53,008 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:16:53,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:16:53,008 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-25 13:16:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:53,009 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:16:53,009 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:16:53,010 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:16:53,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:16:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:16:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:16:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:16:53,013 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 13:16:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:53,013 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:16:53,013 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:16:53,014 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:16:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:16:53,014 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:53,014 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-25 13:16:53,015 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:53,015 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2018-07-25 13:16:53,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:53,282 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:53,282 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:16:53,283 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:16:53,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:16:53,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:16:53,285 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-07-25 13:16:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:53,326 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 13:16:53,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:16:53,326 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-25 13:16:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:53,327 INFO L225 Difference]: With dead ends: 66 [2018-07-25 13:16:53,327 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 13:16:53,328 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:16:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 13:16:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 13:16:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 13:16:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 13:16:53,332 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 13:16:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:53,332 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 13:16:53,332 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:16:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 13:16:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 13:16:53,334 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:53,334 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-25 13:16:53,335 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:53,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2018-07-25 13:16:53,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:53,577 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:53,577 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:16:53,578 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:16:53,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:16:53,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:16:53,580 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-07-25 13:16:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:53,615 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:16:53,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:16:53,615 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-25 13:16:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:53,616 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:16:53,616 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:16:53,617 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:16:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:16:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:16:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:16:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:16:53,620 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 13:16:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:53,620 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:16:53,620 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:16:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:16:53,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:16:53,621 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:53,621 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-25 13:16:53,621 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2018-07-25 13:16:53,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:53,851 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:53,851 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:16:53,851 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:16:53,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:16:53,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:16:53,853 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-07-25 13:16:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:53,895 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 13:16:53,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:16:53,895 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-25 13:16:53,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:53,896 INFO L225 Difference]: With dead ends: 68 [2018-07-25 13:16:53,896 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 13:16:53,897 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:16:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 13:16:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 13:16:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 13:16:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 13:16:53,900 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 13:16:53,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:53,900 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 13:16:53,900 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:16:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 13:16:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 13:16:53,901 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:53,901 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-25 13:16:53,901 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:53,902 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2018-07-25 13:16:53,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:54,130 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:54,130 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:16:54,130 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:16:54,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:16:54,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:16:54,132 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-07-25 13:16:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:54,177 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:16:54,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:16:54,177 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-25 13:16:54,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:54,178 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:16:54,178 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:16:54,179 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:16:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:16:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:16:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:16:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:16:54,182 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 13:16:54,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:54,182 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:16:54,183 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:16:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:16:54,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:16:54,183 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:54,184 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-25 13:16:54,184 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:54,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2018-07-25 13:16:54,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:54,419 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:54,420 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:16:54,420 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:16:54,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:16:54,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:16:54,422 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-07-25 13:16:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:54,452 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 13:16:54,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:16:54,453 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-25 13:16:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:54,453 INFO L225 Difference]: With dead ends: 70 [2018-07-25 13:16:54,453 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 13:16:54,454 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:16:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 13:16:54,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 13:16:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 13:16:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 13:16:54,457 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 13:16:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:54,458 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 13:16:54,458 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:16:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 13:16:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 13:16:54,459 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:54,459 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-25 13:16:54,459 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2018-07-25 13:16:54,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:54,701 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:54,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:16:54,702 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:16:54,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:16:54,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:16:54,704 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-07-25 13:16:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:54,756 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:16:54,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:16:54,756 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-25 13:16:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:54,757 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:16:54,757 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:16:54,758 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:16:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:16:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:16:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:16:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:16:54,762 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 13:16:54,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:54,762 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:16:54,762 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:16:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:16:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:16:54,763 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:54,763 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-25 13:16:54,763 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:54,764 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2018-07-25 13:16:54,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:55,064 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:55,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:16:55,065 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:16:55,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:16:55,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:16:55,067 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-07-25 13:16:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:55,121 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 13:16:55,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:16:55,122 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-25 13:16:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:55,123 INFO L225 Difference]: With dead ends: 72 [2018-07-25 13:16:55,123 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 13:16:55,124 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:16:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 13:16:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 13:16:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 13:16:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 13:16:55,127 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 13:16:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:55,128 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 13:16:55,128 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:16:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 13:16:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 13:16:55,129 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:55,129 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-25 13:16:55,129 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:55,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2018-07-25 13:16:55,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:55,412 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:55,412 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:16:55,413 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:16:55,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:16:55,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:16:55,414 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-07-25 13:16:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:55,453 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:16:55,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:16:55,453 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-25 13:16:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:55,454 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:16:55,454 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:16:55,455 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:16:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:16:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:16:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:16:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:16:55,458 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 13:16:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:55,458 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:16:55,459 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:16:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:16:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:16:55,459 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:55,459 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-25 13:16:55,460 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:55,460 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2018-07-25 13:16:55,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:55,708 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:55,708 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:16:55,709 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:16:55,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:16:55,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:16:55,711 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-07-25 13:16:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:55,748 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 13:16:55,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:16:55,748 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-25 13:16:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:55,749 INFO L225 Difference]: With dead ends: 74 [2018-07-25 13:16:55,749 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 13:16:55,750 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:16:55,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 13:16:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 13:16:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 13:16:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 13:16:55,753 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 13:16:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:55,754 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 13:16:55,754 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:16:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 13:16:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 13:16:55,754 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:55,755 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-25 13:16:55,755 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:55,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2018-07-25 13:16:55,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:56,001 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:56,001 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:16:56,001 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:16:56,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:16:56,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:16:56,003 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-07-25 13:16:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:56,060 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:16:56,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:16:56,061 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-25 13:16:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:56,061 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:16:56,062 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:16:56,062 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:16:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:16:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:16:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:16:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:16:56,065 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 13:16:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:56,066 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:16:56,066 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:16:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:16:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:16:56,066 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:56,067 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-25 13:16:56,067 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:56,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2018-07-25 13:16:56,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:56,309 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:56,309 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:16:56,309 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:16:56,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:16:56,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:16:56,311 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-07-25 13:16:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:56,370 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 13:16:56,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:16:56,370 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-25 13:16:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:56,371 INFO L225 Difference]: With dead ends: 76 [2018-07-25 13:16:56,371 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 13:16:56,372 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:16:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 13:16:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 13:16:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 13:16:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 13:16:56,375 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 13:16:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:56,376 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 13:16:56,376 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:16:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 13:16:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 13:16:56,377 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:56,377 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-25 13:16:56,377 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2018-07-25 13:16:56,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:56,633 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:56,634 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:16:56,634 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:16:56,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:16:56,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:16:56,636 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-07-25 13:16:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:56,699 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:16:56,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:16:56,699 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-25 13:16:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:56,700 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:16:56,700 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:16:56,701 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:16:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:16:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:16:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:16:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:16:56,704 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 13:16:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:56,705 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:16:56,705 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:16:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:16:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:16:56,706 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:56,706 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-25 13:16:56,706 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2018-07-25 13:16:56,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:56,963 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:56,964 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:16:56,964 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:16:56,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:16:56,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:16:56,966 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-07-25 13:16:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:57,041 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 13:16:57,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:16:57,041 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-25 13:16:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:57,042 INFO L225 Difference]: With dead ends: 78 [2018-07-25 13:16:57,042 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 13:16:57,043 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:16:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 13:16:57,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 13:16:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 13:16:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 13:16:57,046 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 13:16:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:57,046 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 13:16:57,046 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:16:57,047 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 13:16:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 13:16:57,047 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:57,047 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-25 13:16:57,048 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:57,048 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2018-07-25 13:16:57,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:57,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:57,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:16:57,312 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:16:57,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:16:57,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:16:57,314 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-07-25 13:16:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:57,383 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:16:57,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:16:57,383 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-25 13:16:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:57,384 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:16:57,384 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:16:57,385 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:16:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:16:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:16:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:16:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:16:57,388 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 13:16:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:57,389 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:16:57,389 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:16:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:16:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:16:57,390 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:57,390 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-25 13:16:57,390 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:57,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2018-07-25 13:16:57,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:57,662 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:57,663 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:16:57,663 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:16:57,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:16:57,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:16:57,665 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-07-25 13:16:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:57,727 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 13:16:57,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:16:57,727 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-25 13:16:57,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:57,728 INFO L225 Difference]: With dead ends: 80 [2018-07-25 13:16:57,728 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 13:16:57,728 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:16:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 13:16:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 13:16:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 13:16:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 13:16:57,732 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 13:16:57,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:57,732 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 13:16:57,732 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:16:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 13:16:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 13:16:57,733 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:57,733 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-25 13:16:57,733 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:57,734 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2018-07-25 13:16:57,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:57,970 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:57,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:16:57,971 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:16:57,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:16:57,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:16:57,972 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-07-25 13:16:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:58,038 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:16:58,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:16:58,038 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-25 13:16:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:58,039 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:16:58,039 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:16:58,040 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:16:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:16:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:16:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:16:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:16:58,043 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 13:16:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:58,043 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:16:58,043 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:16:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:16:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:16:58,044 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:58,044 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-25 13:16:58,044 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:58,045 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2018-07-25 13:16:58,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:58,281 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:58,281 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:16:58,281 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:16:58,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:16:58,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:16:58,283 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-07-25 13:16:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:58,344 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 13:16:58,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:16:58,345 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-25 13:16:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:58,345 INFO L225 Difference]: With dead ends: 82 [2018-07-25 13:16:58,346 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 13:16:58,346 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:16:58,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 13:16:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 13:16:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 13:16:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 13:16:58,349 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 13:16:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:58,350 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 13:16:58,350 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:16:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 13:16:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 13:16:58,351 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:58,351 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-25 13:16:58,351 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:58,351 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2018-07-25 13:16:58,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:58,611 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:58,611 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:16:58,612 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:16:58,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:16:58,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:16:58,614 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-07-25 13:16:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:58,671 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:16:58,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:16:58,671 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-25 13:16:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:58,672 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:16:58,672 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:16:58,673 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:16:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:16:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:16:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:16:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:16:58,677 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 13:16:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:58,677 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:16:58,677 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:16:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:16:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:16:58,678 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:58,678 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-25 13:16:58,678 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2018-07-25 13:16:58,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:58,939 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:58,940 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:16:58,940 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:16:58,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:16:58,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:16:58,942 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-07-25 13:16:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:58,978 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 13:16:58,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:16:58,978 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-25 13:16:58,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:58,979 INFO L225 Difference]: With dead ends: 84 [2018-07-25 13:16:58,979 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 13:16:58,980 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:16:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 13:16:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 13:16:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 13:16:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 13:16:58,983 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 13:16:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:58,983 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 13:16:58,983 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:16:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 13:16:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 13:16:58,984 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:58,984 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-25 13:16:58,985 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:58,985 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2018-07-25 13:16:58,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:59,241 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:59,241 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:16:59,242 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:16:59,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:16:59,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:16:59,243 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-07-25 13:16:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:59,297 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:16:59,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:16:59,298 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-25 13:16:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:59,299 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:16:59,299 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:16:59,300 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:16:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:16:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:16:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:16:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:16:59,303 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 13:16:59,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:59,303 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:16:59,303 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:16:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:16:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:16:59,304 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:59,304 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-25 13:16:59,305 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:59,305 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2018-07-25 13:16:59,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:59,564 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:59,564 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:16:59,565 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:16:59,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:16:59,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:16:59,567 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-07-25 13:16:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:59,644 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 13:16:59,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:16:59,644 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-25 13:16:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:59,645 INFO L225 Difference]: With dead ends: 86 [2018-07-25 13:16:59,645 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 13:16:59,646 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:16:59,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 13:16:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 13:16:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 13:16:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 13:16:59,649 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 13:16:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:59,649 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 13:16:59,649 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:16:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 13:16:59,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 13:16:59,650 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:59,650 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-25 13:16:59,651 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:59,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2018-07-25 13:16:59,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:00,000 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:00,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:17:00,000 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:17:00,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:17:00,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:17:00,003 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-07-25 13:17:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:00,068 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:17:00,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:17:00,068 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-25 13:17:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:00,069 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:17:00,069 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:17:00,070 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:17:00,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:17:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:17:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:17:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:17:00,074 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 13:17:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:00,075 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:17:00,075 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:17:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:17:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:17:00,076 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:00,076 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-25 13:17:00,076 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:00,076 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2018-07-25 13:17:00,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:00,391 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:00,391 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:17:00,392 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:17:00,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:17:00,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:17:00,393 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-07-25 13:17:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:00,437 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 13:17:00,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:17:00,438 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-25 13:17:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:00,438 INFO L225 Difference]: With dead ends: 88 [2018-07-25 13:17:00,438 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 13:17:00,439 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:17:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 13:17:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 13:17:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 13:17:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 13:17:00,442 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 13:17:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:00,443 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 13:17:00,443 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:17:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 13:17:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 13:17:00,444 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:00,444 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-25 13:17:00,444 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:00,444 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2018-07-25 13:17:00,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:00,699 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:00,699 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:17:00,699 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:17:00,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:17:00,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:17:00,701 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-07-25 13:17:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:00,781 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:17:00,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:17:00,782 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-25 13:17:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:00,783 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:17:00,783 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:17:00,784 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:17:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:17:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:17:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:17:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:17:00,787 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 13:17:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:00,787 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:17:00,787 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:17:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:17:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:17:00,788 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:00,788 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-25 13:17:00,788 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:00,789 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2018-07-25 13:17:00,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:01,052 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:01,053 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:17:01,053 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:17:01,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:17:01,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:17:01,054 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-07-25 13:17:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:01,100 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 13:17:01,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:17:01,100 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-25 13:17:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:01,101 INFO L225 Difference]: With dead ends: 90 [2018-07-25 13:17:01,101 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 13:17:01,102 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:17:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 13:17:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 13:17:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 13:17:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 13:17:01,105 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 13:17:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:01,105 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 13:17:01,105 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:17:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 13:17:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 13:17:01,106 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:01,106 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-25 13:17:01,106 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:01,106 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2018-07-25 13:17:01,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:01,332 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:01,332 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:17:01,333 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:17:01,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:17:01,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:17:01,334 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-07-25 13:17:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:01,422 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:17:01,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:17:01,422 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-25 13:17:01,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:01,423 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:17:01,423 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:17:01,424 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:17:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:17:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:17:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:17:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:17:01,427 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 13:17:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:01,427 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:17:01,427 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:17:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:17:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:17:01,428 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:01,428 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-25 13:17:01,428 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:01,428 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2018-07-25 13:17:01,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:01,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:01,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:17:01,645 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:17:01,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:17:01,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:17:01,647 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-07-25 13:17:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:01,699 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 13:17:01,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:17:01,699 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-07-25 13:17:01,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:01,700 INFO L225 Difference]: With dead ends: 92 [2018-07-25 13:17:01,700 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 13:17:01,701 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:17:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 13:17:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 13:17:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 13:17:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 13:17:01,704 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 13:17:01,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:01,705 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 13:17:01,705 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:17:01,705 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 13:17:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 13:17:01,706 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:01,706 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-07-25 13:17:01,706 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:01,706 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2018-07-25 13:17:01,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:01,964 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:01,964 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:17:01,964 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:17:01,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:17:01,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:17:01,965 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-07-25 13:17:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:02,037 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 13:17:02,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:17:02,038 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-07-25 13:17:02,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:02,039 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:17:02,039 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:17:02,040 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:17:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:17:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:17:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:17:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:17:02,043 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 13:17:02,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:02,043 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:17:02,043 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:17:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:17:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:17:02,044 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:02,044 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-07-25 13:17:02,044 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:02,044 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2018-07-25 13:17:02,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:02,349 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:02,349 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:17:02,349 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:17:02,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:17:02,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:17:02,350 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-07-25 13:17:02,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:02,384 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 13:17:02,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:17:02,384 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-07-25 13:17:02,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:02,385 INFO L225 Difference]: With dead ends: 94 [2018-07-25 13:17:02,385 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 13:17:02,385 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:17:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 13:17:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 13:17:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 13:17:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 13:17:02,389 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 13:17:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:02,389 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 13:17:02,390 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:17:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 13:17:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 13:17:02,390 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:02,390 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-07-25 13:17:02,391 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2018-07-25 13:17:02,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:02,701 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:02,701 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:17:02,702 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:17:02,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:17:02,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:17:02,703 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-07-25 13:17:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:02,782 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:17:02,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:17:02,783 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-07-25 13:17:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:02,783 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:17:02,784 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:17:02,784 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:17:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:17:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:17:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:17:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 13:17:02,788 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 13:17:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:02,788 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 13:17:02,788 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:17:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 13:17:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:17:02,789 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:02,789 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-07-25 13:17:02,789 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:02,789 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2018-07-25 13:17:02,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:03,055 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:03,055 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:17:03,055 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:17:03,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:17:03,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:17:03,057 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-07-25 13:17:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:03,106 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 13:17:03,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:17:03,106 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-07-25 13:17:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:03,107 INFO L225 Difference]: With dead ends: 96 [2018-07-25 13:17:03,107 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 13:17:03,108 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:17:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 13:17:03,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 13:17:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 13:17:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 13:17:03,111 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 13:17:03,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:03,111 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 13:17:03,111 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:17:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 13:17:03,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 13:17:03,112 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:03,112 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-07-25 13:17:03,112 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:03,113 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2018-07-25 13:17:03,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:03,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:03,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:17:03,393 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:17:03,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:17:03,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:17:03,394 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-07-25 13:17:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:03,435 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 13:17:03,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:17:03,436 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-07-25 13:17:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:03,436 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:17:03,437 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:17:03,437 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:17:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:17:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:17:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:17:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 13:17:03,440 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 13:17:03,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:03,441 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 13:17:03,441 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:17:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 13:17:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:17:03,441 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:03,442 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-07-25 13:17:03,442 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:03,442 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2018-07-25 13:17:03,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:03,792 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:03,792 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:17:03,793 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:17:03,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:17:03,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:17:03,795 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-07-25 13:17:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:03,920 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 13:17:03,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:17:03,921 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-07-25 13:17:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:03,922 INFO L225 Difference]: With dead ends: 98 [2018-07-25 13:17:03,922 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 13:17:03,923 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:17:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 13:17:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 13:17:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 13:17:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 13:17:03,926 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 13:17:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:03,926 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 13:17:03,926 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:17:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 13:17:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 13:17:03,927 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:03,927 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-07-25 13:17:03,927 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:03,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2018-07-25 13:17:03,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:04,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:04,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:17:04,303 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:17:04,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:17:04,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:17:04,305 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-07-25 13:17:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:04,394 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 13:17:04,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:17:04,394 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-07-25 13:17:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:04,395 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:17:04,395 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:17:04,396 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:17:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:17:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:17:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:17:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 13:17:04,399 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 13:17:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:04,399 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 13:17:04,400 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:17:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 13:17:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:17:04,400 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:04,400 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-07-25 13:17:04,401 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:04,401 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2018-07-25 13:17:04,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:04,682 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:04,682 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:17:04,682 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:17:04,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:17:04,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:17:04,685 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-07-25 13:17:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:04,756 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 13:17:04,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:17:04,756 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-07-25 13:17:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:04,757 INFO L225 Difference]: With dead ends: 100 [2018-07-25 13:17:04,757 INFO L226 Difference]: Without dead ends: 98 [2018-07-25 13:17:04,758 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:17:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-25 13:17:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-25 13:17:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 13:17:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-25 13:17:04,762 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-25 13:17:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:04,762 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-25 13:17:04,762 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:17:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-25 13:17:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-25 13:17:04,763 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:04,763 INFO L354 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-07-25 13:17:04,763 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:04,763 INFO L82 PathProgramCache]: Analyzing trace with hash -819778975, now seen corresponding path program 94 times [2018-07-25 13:17:04,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:05,108 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:05,109 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:17:05,109 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:17:05,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:17:05,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:17:05,111 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-07-25 13:17:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:05,153 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 13:17:05,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:17:05,153 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-07-25 13:17:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:05,154 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:17:05,154 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:17:05,155 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:17:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:17:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:17:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:17:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 13:17:05,157 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-25 13:17:05,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:05,158 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 13:17:05,158 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:17:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 13:17:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:17:05,159 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:05,159 INFO L354 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-07-25 13:17:05,159 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:05,159 INFO L82 PathProgramCache]: Analyzing trace with hash 356653576, now seen corresponding path program 95 times [2018-07-25 13:17:05,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:05,420 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:05,420 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:17:05,421 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:17:05,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:17:05,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:17:05,423 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-07-25 13:17:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:05,464 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-25 13:17:05,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:17:05,465 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-07-25 13:17:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:05,465 INFO L225 Difference]: With dead ends: 102 [2018-07-25 13:17:05,465 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 13:17:05,466 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:17:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 13:17:05,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-25 13:17:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 13:17:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-25 13:17:05,469 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-25 13:17:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:05,469 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-25 13:17:05,469 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:17:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-25 13:17:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-25 13:17:05,470 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:05,470 INFO L354 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-07-25 13:17:05,471 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:05,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1828643007, now seen corresponding path program 96 times [2018-07-25 13:17:05,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:05,736 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:05,736 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:17:05,737 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:17:05,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:17:05,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:17:05,738 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-07-25 13:17:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:05,795 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 13:17:05,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:17:05,795 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-07-25 13:17:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:05,796 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:17:05,796 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:17:05,797 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:17:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:17:05,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:17:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:17:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 13:17:05,800 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-25 13:17:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:05,801 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 13:17:05,801 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:17:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 13:17:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:17:05,801 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:05,802 INFO L354 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-07-25 13:17:05,802 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:05,802 INFO L82 PathProgramCache]: Analyzing trace with hash -853360344, now seen corresponding path program 97 times [2018-07-25 13:17:05,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:06,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:06,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:17:06,061 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:17:06,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:17:06,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:17:06,062 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-07-25 13:17:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:06,137 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-25 13:17:06,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:17:06,138 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-07-25 13:17:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:06,139 INFO L225 Difference]: With dead ends: 104 [2018-07-25 13:17:06,139 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 13:17:06,140 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:17:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 13:17:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-25 13:17:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 13:17:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-25 13:17:06,143 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-25 13:17:06,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:06,144 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-25 13:17:06,144 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:17:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-25 13:17:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-25 13:17:06,144 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:06,144 INFO L354 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-07-25 13:17:06,145 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash -684368863, now seen corresponding path program 98 times [2018-07-25 13:17:06,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:06,554 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:06,554 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:17:06,555 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:17:06,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:17:06,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:17:06,557 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-07-25 13:17:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:06,647 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 13:17:06,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:17:06,648 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-07-25 13:17:06,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:06,649 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:17:06,649 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:17:06,650 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:17:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:17:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:17:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:17:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 13:17:06,654 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-25 13:17:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:06,654 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 13:17:06,654 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:17:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 13:17:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:17:06,655 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:06,655 INFO L354 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-07-25 13:17:06,656 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:06,656 INFO L82 PathProgramCache]: Analyzing trace with hash 259399752, now seen corresponding path program 99 times [2018-07-25 13:17:06,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:06,959 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:06,960 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:17:06,960 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:17:06,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:17:06,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:17:06,962 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-07-25 13:17:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:07,024 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-25 13:17:07,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:17:07,024 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-07-25 13:17:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:07,025 INFO L225 Difference]: With dead ends: 106 [2018-07-25 13:17:07,025 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 13:17:07,027 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:17:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 13:17:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 13:17:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 13:17:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-25 13:17:07,030 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-25 13:17:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:07,030 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-25 13:17:07,030 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:17:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-25 13:17:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 13:17:07,031 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:07,031 INFO L354 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-07-25 13:17:07,031 INFO L415 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:07,032 INFO L82 PathProgramCache]: Analyzing trace with hash -548544255, now seen corresponding path program 100 times [2018-07-25 13:17:07,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:07,350 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:07,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:17:07,350 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:17:07,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:17:07,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:17:07,352 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-07-25 13:17:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:07,414 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 13:17:07,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 13:17:07,414 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-07-25 13:17:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:07,415 INFO L225 Difference]: With dead ends: 107 [2018-07-25 13:17:07,415 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:17:07,416 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:17:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:17:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:17:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:17:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 13:17:07,420 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-25 13:17:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:07,420 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 13:17:07,420 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:17:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 13:17:07,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:17:07,421 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:07,421 INFO L354 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-07-25 13:17:07,421 INFO L415 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:07,421 INFO L82 PathProgramCache]: Analyzing trace with hash 174995304, now seen corresponding path program 101 times [2018-07-25 13:17:07,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:07,697 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:07,697 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:17:07,697 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:17:07,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:17:07,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:17:07,699 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-07-25 13:17:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:07,768 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-25 13:17:07,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:17:07,768 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-07-25 13:17:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:07,769 INFO L225 Difference]: With dead ends: 108 [2018-07-25 13:17:07,769 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 13:17:07,771 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:17:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 13:17:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-25 13:17:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 13:17:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 13:17:07,774 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-07-25 13:17:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:07,774 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 13:17:07,774 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:17:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 13:17:07,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 13:17:07,775 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:07,775 INFO L354 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-07-25 13:17:07,775 INFO L415 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:07,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1129885153, now seen corresponding path program 102 times [2018-07-25 13:17:07,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:08,065 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:08,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 13:17:08,065 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:17:08,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:17:08,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:17:08,068 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-07-25 13:17:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:08,158 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 13:17:08,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 13:17:08,158 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-07-25 13:17:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:08,159 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:17:08,159 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:17:08,160 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:17:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:17:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:17:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:17:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 13:17:08,163 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-07-25 13:17:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:08,163 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 13:17:08,163 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:17:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 13:17:08,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:17:08,163 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:08,163 INFO L354 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-07-25 13:17:08,164 INFO L415 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:08,164 INFO L82 PathProgramCache]: Analyzing trace with hash 666699400, now seen corresponding path program 103 times [2018-07-25 13:17:08,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:08,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:08,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:17:08,452 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:17:08,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:17:08,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:17:08,454 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-07-25 13:17:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:08,568 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 13:17:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:17:08,568 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-07-25 13:17:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:08,568 INFO L225 Difference]: With dead ends: 110 [2018-07-25 13:17:08,568 INFO L226 Difference]: Without dead ends: 108 [2018-07-25 13:17:08,570 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:17:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-25 13:17:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-25 13:17:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 13:17:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-25 13:17:08,572 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-07-25 13:17:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:08,573 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-25 13:17:08,573 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:17:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-25 13:17:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-25 13:17:08,573 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:08,573 INFO L354 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-07-25 13:17:08,573 INFO L415 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:08,574 INFO L82 PathProgramCache]: Analyzing trace with hash -807157055, now seen corresponding path program 104 times [2018-07-25 13:17:08,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:08,877 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:08,877 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 13:17:08,877 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 13:17:08,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 13:17:08,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:17:08,879 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-07-25 13:17:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:08,964 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 13:17:08,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 13:17:08,965 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-07-25 13:17:08,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:08,965 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:17:08,965 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:17:08,967 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:17:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:17:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:17:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:17:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 13:17:08,970 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-07-25 13:17:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:08,970 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 13:17:08,970 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 13:17:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 13:17:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:17:08,971 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:08,971 INFO L354 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-07-25 13:17:08,971 INFO L415 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash 747933096, now seen corresponding path program 105 times [2018-07-25 13:17:08,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:09,328 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:09,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:17:09,328 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:17:09,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:17:09,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:17:09,330 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-07-25 13:17:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:09,387 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-25 13:17:09,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:17:09,387 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-07-25 13:17:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:09,388 INFO L225 Difference]: With dead ends: 112 [2018-07-25 13:17:09,388 INFO L226 Difference]: Without dead ends: 110 [2018-07-25 13:17:09,389 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:17:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-25 13:17:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-25 13:17:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-25 13:17:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-25 13:17:09,392 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-07-25 13:17:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:09,393 INFO L472 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-25 13:17:09,393 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:17:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-25 13:17:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-25 13:17:09,394 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:09,394 INFO L354 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-07-25 13:17:09,394 INFO L415 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:09,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1711087521, now seen corresponding path program 106 times [2018-07-25 13:17:09,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:09,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:09,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 13:17:09,757 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 13:17:09,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 13:17:09,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:17:09,759 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-07-25 13:17:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:09,850 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 13:17:09,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 13:17:09,851 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-07-25 13:17:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:09,851 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:17:09,851 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:17:09,853 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:17:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:17:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:17:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:17:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 13:17:09,856 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-07-25 13:17:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:09,856 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 13:17:09,856 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 13:17:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 13:17:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:17:09,857 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:09,857 INFO L354 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-07-25 13:17:09,857 INFO L415 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:09,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103624, now seen corresponding path program 107 times [2018-07-25 13:17:09,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:10,179 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:10,179 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 13:17:10,179 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 13:17:10,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 13:17:10,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:17:10,182 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-07-25 13:17:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:10,306 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-25 13:17:10,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:17:10,307 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-07-25 13:17:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:10,307 INFO L225 Difference]: With dead ends: 114 [2018-07-25 13:17:10,307 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 13:17:10,308 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:17:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 13:17:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-25 13:17:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-25 13:17:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-25 13:17:10,311 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-07-25 13:17:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:10,311 INFO L472 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-25 13:17:10,311 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 13:17:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-25 13:17:10,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-25 13:17:10,312 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:10,312 INFO L354 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-07-25 13:17:10,312 INFO L415 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:10,313 INFO L82 PathProgramCache]: Analyzing trace with hash -617429887, now seen corresponding path program 108 times [2018-07-25 13:17:10,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:10,677 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:10,677 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 13:17:10,678 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 13:17:10,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 13:17:10,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:17:10,680 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-07-25 13:17:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:10,767 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 13:17:10,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 13:17:10,767 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-07-25 13:17:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:10,768 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:17:10,768 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:17:10,769 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:17:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:17:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:17:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:17:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 13:17:10,772 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-07-25 13:17:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:10,772 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 13:17:10,772 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 13:17:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 13:17:10,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:17:10,773 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:10,773 INFO L354 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-07-25 13:17:10,773 INFO L415 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:10,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459288, now seen corresponding path program 109 times [2018-07-25 13:17:10,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:11,116 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:11,116 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 13:17:11,116 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 13:17:11,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 13:17:11,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:17:11,118 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-07-25 13:17:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:11,253 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-25 13:17:11,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:17:11,254 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-07-25 13:17:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:11,254 INFO L225 Difference]: With dead ends: 116 [2018-07-25 13:17:11,254 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 13:17:11,256 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:17:11,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 13:17:11,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-25 13:17:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-25 13:17:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-25 13:17:11,259 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-07-25 13:17:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:11,259 INFO L472 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-25 13:17:11,260 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 13:17:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-25 13:17:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-25 13:17:11,260 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:11,260 INFO L354 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-07-25 13:17:11,261 INFO L415 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash -644697759, now seen corresponding path program 110 times [2018-07-25 13:17:11,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:11,610 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:11,610 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 13:17:11,611 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 13:17:11,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 13:17:11,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:17:11,612 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-07-25 13:17:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:11,693 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 13:17:11,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:17:11,693 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-07-25 13:17:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:11,694 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:17:11,694 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:17:11,695 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:17:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:17:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:17:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:17:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 13:17:11,698 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-07-25 13:17:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:11,699 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 13:17:11,699 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 13:17:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 13:17:11,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:17:11,700 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:11,700 INFO L354 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-07-25 13:17:11,700 INFO L415 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:11,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1489203976, now seen corresponding path program 111 times [2018-07-25 13:17:11,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:12,298 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:12,298 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 13:17:12,298 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 13:17:12,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 13:17:12,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:17:12,301 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-07-25 13:17:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:12,526 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-25 13:17:12,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:17:12,527 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-07-25 13:17:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:12,527 INFO L225 Difference]: With dead ends: 118 [2018-07-25 13:17:12,527 INFO L226 Difference]: Without dead ends: 116 [2018-07-25 13:17:12,528 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:17:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-25 13:17:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-25 13:17:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 13:17:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 13:17:12,534 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-07-25 13:17:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:12,534 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 13:17:12,535 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 13:17:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 13:17:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 13:17:12,535 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:12,535 INFO L354 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-07-25 13:17:12,536 INFO L415 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1079318975, now seen corresponding path program 112 times [2018-07-25 13:17:12,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:12,931 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:12,931 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 13:17:12,932 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 13:17:12,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 13:17:12,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:17:12,934 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-07-25 13:17:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:13,074 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 13:17:13,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 13:17:13,074 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-07-25 13:17:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:13,075 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:17:13,075 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:17:13,076 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:17:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:17:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:17:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:17:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 13:17:13,080 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-07-25 13:17:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:13,080 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 13:17:13,080 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 13:17:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 13:17:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:17:13,081 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:13,081 INFO L354 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-07-25 13:17:13,081 INFO L415 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:13,081 INFO L82 PathProgramCache]: Analyzing trace with hash 900848168, now seen corresponding path program 113 times [2018-07-25 13:17:13,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:13,549 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:13,549 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 13:17:13,549 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 13:17:13,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 13:17:13,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:17:13,551 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2018-07-25 13:17:13,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:13,691 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 13:17:13,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:17:13,691 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-07-25 13:17:13,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:13,691 INFO L225 Difference]: With dead ends: 120 [2018-07-25 13:17:13,691 INFO L226 Difference]: Without dead ends: 118 [2018-07-25 13:17:13,693 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:17:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-25 13:17:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-25 13:17:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 13:17:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-25 13:17:13,696 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-07-25 13:17:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:13,697 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-25 13:17:13,697 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 13:17:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-25 13:17:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-25 13:17:13,697 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:13,698 INFO L354 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2018-07-25 13:17:13,698 INFO L415 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:13,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2138479839, now seen corresponding path program 114 times [2018-07-25 13:17:13,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:14,256 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:14,256 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 13:17:14,256 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 13:17:14,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 13:17:14,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:17:14,259 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2018-07-25 13:17:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:14,422 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 13:17:14,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 13:17:14,422 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2018-07-25 13:17:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:14,423 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:17:14,423 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:17:14,424 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:17:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:17:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:17:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:17:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 13:17:14,428 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-07-25 13:17:14,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:14,428 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 13:17:14,428 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 13:17:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 13:17:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:17:14,429 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:14,429 INFO L354 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2018-07-25 13:17:14,429 INFO L415 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:14,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1868367544, now seen corresponding path program 115 times [2018-07-25 13:17:14,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:14,970 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:14,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 13:17:14,971 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 13:17:14,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 13:17:14,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:17:14,973 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2018-07-25 13:17:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:15,119 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-25 13:17:15,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:17:15,119 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2018-07-25 13:17:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:15,120 INFO L225 Difference]: With dead ends: 122 [2018-07-25 13:17:15,120 INFO L226 Difference]: Without dead ends: 120 [2018-07-25 13:17:15,121 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:17:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-25 13:17:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-25 13:17:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-25 13:17:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-25 13:17:15,124 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-07-25 13:17:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:15,125 INFO L472 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-25 13:17:15,125 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 13:17:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-25 13:17:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-25 13:17:15,126 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:15,126 INFO L354 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2018-07-25 13:17:15,126 INFO L415 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:15,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2084820991, now seen corresponding path program 116 times [2018-07-25 13:17:15,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:15,807 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:15,808 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 13:17:15,808 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 13:17:15,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 13:17:15,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:17:15,811 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2018-07-25 13:17:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:15,986 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 13:17:15,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 13:17:15,986 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2018-07-25 13:17:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:15,987 INFO L225 Difference]: With dead ends: 123 [2018-07-25 13:17:15,987 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:17:15,988 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:17:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:17:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:17:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:17:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 13:17:15,991 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-07-25 13:17:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:15,991 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 13:17:15,991 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 13:17:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 13:17:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:17:15,992 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:15,992 INFO L354 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2018-07-25 13:17:15,992 INFO L415 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:15,992 INFO L82 PathProgramCache]: Analyzing trace with hash -204943256, now seen corresponding path program 117 times [2018-07-25 13:17:15,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:16,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:16,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 13:17:16,365 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 13:17:16,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 13:17:16,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:17:16,367 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2018-07-25 13:17:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:16,500 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-25 13:17:16,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:17:16,500 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2018-07-25 13:17:16,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:16,501 INFO L225 Difference]: With dead ends: 124 [2018-07-25 13:17:16,501 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 13:17:16,502 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:17:16,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 13:17:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-25 13:17:16,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-25 13:17:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-25 13:17:16,505 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-07-25 13:17:16,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:16,505 INFO L472 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-25 13:17:16,505 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 13:17:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-25 13:17:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-25 13:17:16,506 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:16,506 INFO L354 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2018-07-25 13:17:16,506 INFO L415 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:16,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2058275615, now seen corresponding path program 118 times [2018-07-25 13:17:16,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:16,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:16,847 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 13:17:16,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 13:17:16,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 13:17:16,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:17:16,850 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 121 states. [2018-07-25 13:17:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:16,956 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 13:17:16,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 13:17:16,957 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 121 [2018-07-25 13:17:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:16,957 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:17:16,957 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:17:16,959 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:17:16,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:17:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:17:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:17:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 13:17:16,962 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-07-25 13:17:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:16,962 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 13:17:16,962 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 13:17:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 13:17:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:17:16,963 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:16,963 INFO L354 BasicCegarLoop]: trace histogram [119, 1, 1, 1] [2018-07-25 13:17:16,963 INFO L415 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash 617963400, now seen corresponding path program 119 times [2018-07-25 13:17:16,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:17,336 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:17:17,337 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:17,337 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 13:17:17,337 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 13:17:17,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 13:17:17,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:17:17,339 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 122 states. [2018-07-25 13:17:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:17,397 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-25 13:17:17,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:17:17,397 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 122 [2018-07-25 13:17:17,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:17,398 INFO L225 Difference]: With dead ends: 126 [2018-07-25 13:17:17,398 INFO L226 Difference]: Without dead ends: 124 [2018-07-25 13:17:17,399 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:17:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-25 13:17:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-25 13:17:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 13:17:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-25 13:17:17,401 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-07-25 13:17:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:17,401 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-25 13:17:17,401 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 13:17:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-25 13:17:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-25 13:17:17,401 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:17,401 INFO L354 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2018-07-25 13:17:17,401 INFO L415 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:17,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1976994241, now seen corresponding path program 120 times [2018-07-25 13:17:17,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:17,773 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:17,773 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 13:17:17,773 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 13:17:17,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 13:17:17,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:17:17,775 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2018-07-25 13:17:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:17,915 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 13:17:17,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 13:17:17,915 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2018-07-25 13:17:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:17,916 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:17:17,916 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:17:17,917 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:17:17,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:17:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:17:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:17:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 13:17:17,920 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-07-25 13:17:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:17,920 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 13:17:17,920 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 13:17:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 13:17:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:17:17,921 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:17,921 INFO L354 BasicCegarLoop]: trace histogram [121, 1, 1, 1] [2018-07-25 13:17:17,921 INFO L415 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:17,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1157277352, now seen corresponding path program 121 times [2018-07-25 13:17:17,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:18,405 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:18,405 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 13:17:18,405 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 13:17:18,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 13:17:18,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:17:18,407 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 124 states. [2018-07-25 13:17:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:18,513 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-25 13:17:18,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 13:17:18,513 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 124 [2018-07-25 13:17:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:18,513 INFO L225 Difference]: With dead ends: 128 [2018-07-25 13:17:18,513 INFO L226 Difference]: Without dead ends: 126 [2018-07-25 13:17:18,514 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:17:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-25 13:17:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-25 13:17:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 13:17:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 13:17:18,516 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-07-25 13:17:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:18,517 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 13:17:18,517 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 13:17:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 13:17:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 13:17:18,517 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:18,517 INFO L354 BasicCegarLoop]: trace histogram [122, 1, 1, 1] [2018-07-25 13:17:18,517 INFO L415 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:18,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1515857569, now seen corresponding path program 122 times [2018-07-25 13:17:18,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:18,875 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:18,875 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 13:17:18,875 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 13:17:18,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 13:17:18,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:17:18,877 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 125 states. [2018-07-25 13:17:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:19,052 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 13:17:19,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 13:17:19,052 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 125 [2018-07-25 13:17:19,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:19,053 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:17:19,053 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:17:19,054 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:17:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:17:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:17:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:17:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 13:17:19,056 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-07-25 13:17:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:19,057 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 13:17:19,057 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 13:17:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 13:17:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:17:19,057 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:19,057 INFO L354 BasicCegarLoop]: trace histogram [123, 1, 1, 1] [2018-07-25 13:17:19,058 INFO L415 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:19,058 INFO L82 PathProgramCache]: Analyzing trace with hash -253057592, now seen corresponding path program 123 times [2018-07-25 13:17:19,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:19,458 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:19,458 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 13:17:19,459 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 13:17:19,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 13:17:19,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:17:19,461 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 126 states. [2018-07-25 13:17:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:19,614 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 13:17:19,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 13:17:19,614 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 126 [2018-07-25 13:17:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:19,615 INFO L225 Difference]: With dead ends: 130 [2018-07-25 13:17:19,615 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 13:17:19,616 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:17:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 13:17:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-25 13:17:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 13:17:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-25 13:17:19,618 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-07-25 13:17:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:19,618 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-25 13:17:19,618 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 13:17:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-25 13:17:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-25 13:17:19,619 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:19,619 INFO L354 BasicCegarLoop]: trace histogram [124, 1, 1, 1] [2018-07-25 13:17:19,619 INFO L415 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:19,619 INFO L82 PathProgramCache]: Analyzing trace with hash 745147265, now seen corresponding path program 124 times [2018-07-25 13:17:19,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:20,052 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:20,052 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 13:17:20,052 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 13:17:20,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 13:17:20,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:17:20,055 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 127 states. [2018-07-25 13:17:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:20,231 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 13:17:20,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 13:17:20,231 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 127 [2018-07-25 13:17:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:20,232 INFO L225 Difference]: With dead ends: 131 [2018-07-25 13:17:20,232 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:17:20,233 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:17:20,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:17:20,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:17:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:17:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 13:17:20,235 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-07-25 13:17:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:20,236 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 13:17:20,236 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 13:17:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 13:17:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:17:20,236 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:20,237 INFO L354 BasicCegarLoop]: trace histogram [125, 1, 1, 1] [2018-07-25 13:17:20,237 INFO L415 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:20,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1624726760, now seen corresponding path program 125 times [2018-07-25 13:17:20,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:20,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:20,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 13:17:20,630 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 13:17:20,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 13:17:20,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:17:20,632 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 128 states. [2018-07-25 13:17:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:20,732 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-25 13:17:20,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 13:17:20,732 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 128 [2018-07-25 13:17:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:20,732 INFO L225 Difference]: With dead ends: 132 [2018-07-25 13:17:20,732 INFO L226 Difference]: Without dead ends: 130 [2018-07-25 13:17:20,733 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:17:20,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-25 13:17:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-25 13:17:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-25 13:17:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-25 13:17:20,736 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-07-25 13:17:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:20,736 INFO L472 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-25 13:17:20,736 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 13:17:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-25 13:17:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 13:17:20,737 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:20,737 INFO L354 BasicCegarLoop]: trace histogram [126, 1, 1, 1] [2018-07-25 13:17:20,737 INFO L415 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:20,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1173079967, now seen corresponding path program 126 times [2018-07-25 13:17:20,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:21,251 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:21,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 13:17:21,252 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 13:17:21,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 13:17:21,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:17:21,255 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 129 states. [2018-07-25 13:17:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:21,500 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 13:17:21,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 13:17:21,501 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 129 [2018-07-25 13:17:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:21,501 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:17:21,501 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:17:21,502 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:17:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:17:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:17:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:17:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 13:17:21,505 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-07-25 13:17:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:21,505 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 13:17:21,505 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 13:17:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 13:17:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:17:21,506 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:21,506 INFO L354 BasicCegarLoop]: trace histogram [127, 1, 1, 1] [2018-07-25 13:17:21,506 INFO L415 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2005742584, now seen corresponding path program 127 times [2018-07-25 13:17:21,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:21,888 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:21,888 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 13:17:21,888 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 13:17:21,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 13:17:21,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:17:21,891 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 130 states. [2018-07-25 13:17:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:21,958 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-25 13:17:21,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:17:21,958 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 130 [2018-07-25 13:17:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:21,959 INFO L225 Difference]: With dead ends: 134 [2018-07-25 13:17:21,959 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 13:17:21,960 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:17:21,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 13:17:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-25 13:17:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 13:17:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-25 13:17:21,963 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-07-25 13:17:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:21,964 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-25 13:17:21,964 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 13:17:21,964 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-25 13:17:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 13:17:21,964 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:21,965 INFO L354 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2018-07-25 13:17:21,965 INFO L415 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:21,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2048479935, now seen corresponding path program 128 times [2018-07-25 13:17:21,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:22,399 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:22,399 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 13:17:22,399 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 13:17:22,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 13:17:22,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:17:22,402 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2018-07-25 13:17:22,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:22,588 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 13:17:22,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 13:17:22,588 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2018-07-25 13:17:22,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:22,589 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:17:22,589 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:17:22,590 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:17:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:17:22,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:17:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:17:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 13:17:22,593 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-07-25 13:17:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:22,593 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 13:17:22,593 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 13:17:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 13:17:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:17:22,594 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:22,594 INFO L354 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2018-07-25 13:17:22,594 INFO L415 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:22,594 INFO L82 PathProgramCache]: Analyzing trace with hash 921629480, now seen corresponding path program 129 times [2018-07-25 13:17:22,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:23,064 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:23,064 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 13:17:23,064 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 13:17:23,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 13:17:23,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:17:23,066 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 132 states. [2018-07-25 13:17:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:23,245 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-25 13:17:23,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:17:23,245 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 132 [2018-07-25 13:17:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:23,246 INFO L225 Difference]: With dead ends: 136 [2018-07-25 13:17:23,246 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 13:17:23,247 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:17:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 13:17:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-25 13:17:23,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-25 13:17:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-25 13:17:23,250 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-07-25 13:17:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:23,250 INFO L472 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-25 13:17:23,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 13:17:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-25 13:17:23,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-25 13:17:23,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:23,251 INFO L354 BasicCegarLoop]: trace histogram [130, 1, 1, 1] [2018-07-25 13:17:23,251 INFO L415 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:23,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1494259167, now seen corresponding path program 130 times [2018-07-25 13:17:23,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:23,737 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:23,737 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 13:17:23,738 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 13:17:23,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 13:17:23,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:17:23,740 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 133 states. [2018-07-25 13:17:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:23,941 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 13:17:23,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 13:17:23,941 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 133 [2018-07-25 13:17:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:23,942 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:17:23,942 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:17:23,943 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:17:23,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:17:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:17:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:17:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 13:17:23,946 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-07-25 13:17:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:23,946 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 13:17:23,946 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 13:17:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 13:17:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:17:23,946 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:23,946 INFO L354 BasicCegarLoop]: trace histogram [131, 1, 1, 1] [2018-07-25 13:17:23,947 INFO L415 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:23,947 INFO L82 PathProgramCache]: Analyzing trace with hash 922604104, now seen corresponding path program 131 times [2018-07-25 13:17:23,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:24,475 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:24,475 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 13:17:24,475 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 13:17:24,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 13:17:24,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:17:24,477 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 134 states. [2018-07-25 13:17:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:24,692 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-25 13:17:24,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:17:24,692 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 134 [2018-07-25 13:17:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:24,692 INFO L225 Difference]: With dead ends: 138 [2018-07-25 13:17:24,693 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 13:17:24,694 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:17:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 13:17:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-25 13:17:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 13:17:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 13:17:24,697 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-07-25 13:17:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:24,697 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 13:17:24,697 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 13:17:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 13:17:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 13:17:24,698 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:24,698 INFO L354 BasicCegarLoop]: trace histogram [132, 1, 1, 1] [2018-07-25 13:17:24,698 INFO L415 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1464045823, now seen corresponding path program 132 times [2018-07-25 13:17:24,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:25,203 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:25,203 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 13:17:25,204 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 13:17:25,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 13:17:25,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:17:25,206 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 135 states. [2018-07-25 13:17:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:25,365 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 13:17:25,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 13:17:25,365 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 135 [2018-07-25 13:17:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:25,366 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:17:25,366 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:17:25,368 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:17:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:17:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:17:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:17:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 13:17:25,371 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-07-25 13:17:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:25,371 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 13:17:25,371 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 13:17:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 13:17:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:17:25,372 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:25,372 INFO L354 BasicCegarLoop]: trace histogram [133, 1, 1, 1] [2018-07-25 13:17:25,373 INFO L415 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1859217768, now seen corresponding path program 133 times [2018-07-25 13:17:25,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:25,883 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:25,883 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 13:17:25,884 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 13:17:25,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 13:17:25,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:17:25,886 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 136 states. [2018-07-25 13:17:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:26,101 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 13:17:26,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:17:26,101 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 136 [2018-07-25 13:17:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:26,101 INFO L225 Difference]: With dead ends: 140 [2018-07-25 13:17:26,102 INFO L226 Difference]: Without dead ends: 138 [2018-07-25 13:17:26,104 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:17:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-25 13:17:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-25 13:17:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 13:17:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-25 13:17:26,107 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-07-25 13:17:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:26,107 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-25 13:17:26,107 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 13:17:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-25 13:17:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-25 13:17:26,108 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:26,108 INFO L354 BasicCegarLoop]: trace histogram [134, 1, 1, 1] [2018-07-25 13:17:26,108 INFO L415 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1801173985, now seen corresponding path program 134 times [2018-07-25 13:17:26,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:26,625 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:26,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 13:17:26,625 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 13:17:26,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 13:17:26,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:17:26,628 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 137 states. [2018-07-25 13:17:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:26,861 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 13:17:26,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 13:17:26,861 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 137 [2018-07-25 13:17:26,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:26,862 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:17:26,862 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:17:26,863 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:17:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:17:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:17:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:17:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 13:17:26,865 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-07-25 13:17:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:26,866 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 13:17:26,866 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 13:17:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 13:17:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:17:26,866 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:26,866 INFO L354 BasicCegarLoop]: trace histogram [135, 1, 1, 1] [2018-07-25 13:17:26,866 INFO L415 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:26,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1816712, now seen corresponding path program 135 times [2018-07-25 13:17:26,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:27,378 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:27,378 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 13:17:27,378 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 13:17:27,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 13:17:27,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:17:27,381 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 138 states. [2018-07-25 13:17:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:27,641 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-25 13:17:27,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 13:17:27,641 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 138 [2018-07-25 13:17:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:27,642 INFO L225 Difference]: With dead ends: 142 [2018-07-25 13:17:27,642 INFO L226 Difference]: Without dead ends: 140 [2018-07-25 13:17:27,643 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:17:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-25 13:17:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-25 13:17:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-25 13:17:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-25 13:17:27,646 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-07-25 13:17:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:27,647 INFO L472 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-25 13:17:27,647 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 13:17:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-25 13:17:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 13:17:27,647 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:27,648 INFO L354 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2018-07-25 13:17:27,648 INFO L415 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:27,648 INFO L82 PathProgramCache]: Analyzing trace with hash 56316097, now seen corresponding path program 136 times [2018-07-25 13:17:27,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:28,340 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:28,340 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 13:17:28,341 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 13:17:28,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 13:17:28,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:17:28,343 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 139 states. [2018-07-25 13:17:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:28,440 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 13:17:28,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 13:17:28,440 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 139 [2018-07-25 13:17:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:28,441 INFO L225 Difference]: With dead ends: 143 [2018-07-25 13:17:28,441 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:17:28,441 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:17:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:17:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:17:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:17:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 13:17:28,444 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-07-25 13:17:28,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:28,444 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 13:17:28,444 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 13:17:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 13:17:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:17:28,444 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:28,445 INFO L354 BasicCegarLoop]: trace histogram [137, 1, 1, 1] [2018-07-25 13:17:28,445 INFO L415 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:28,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1745797032, now seen corresponding path program 137 times [2018-07-25 13:17:28,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:28,959 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:28,959 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 13:17:28,960 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 13:17:28,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 13:17:28,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:17:28,963 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 140 states. [2018-07-25 13:17:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:29,202 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-25 13:17:29,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 13:17:29,203 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2018-07-25 13:17:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:29,203 INFO L225 Difference]: With dead ends: 144 [2018-07-25 13:17:29,203 INFO L226 Difference]: Without dead ends: 142 [2018-07-25 13:17:29,204 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:17:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-25 13:17:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-25 13:17:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-25 13:17:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-25 13:17:29,206 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-07-25 13:17:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:29,206 INFO L472 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-25 13:17:29,207 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 13:17:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-25 13:17:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-25 13:17:29,207 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:29,207 INFO L354 BasicCegarLoop]: trace histogram [138, 1, 1, 1] [2018-07-25 13:17:29,207 INFO L415 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:29,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1714868831, now seen corresponding path program 138 times [2018-07-25 13:17:29,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:29,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:29,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 13:17:29,721 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 13:17:29,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 13:17:29,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:17:29,724 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 141 states. [2018-07-25 13:17:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:29,999 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 13:17:29,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 13:17:29,999 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 141 [2018-07-25 13:17:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:30,000 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:17:30,000 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:17:30,001 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:17:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:17:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:17:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:17:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 13:17:30,004 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-07-25 13:17:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:30,004 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 13:17:30,005 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 13:17:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 13:17:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:17:30,005 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:30,006 INFO L354 BasicCegarLoop]: trace histogram [139, 1, 1, 1] [2018-07-25 13:17:30,006 INFO L415 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:30,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1621328184, now seen corresponding path program 139 times [2018-07-25 13:17:30,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:30,553 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:30,553 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 13:17:30,554 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 13:17:30,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 13:17:30,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:17:30,556 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 142 states. [2018-07-25 13:17:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:30,823 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-25 13:17:30,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 13:17:30,823 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 142 [2018-07-25 13:17:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:30,824 INFO L225 Difference]: With dead ends: 146 [2018-07-25 13:17:30,824 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 13:17:30,825 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:17:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 13:17:30,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 13:17:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 13:17:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-25 13:17:30,828 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-07-25 13:17:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:30,829 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-25 13:17:30,829 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 13:17:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-25 13:17:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-25 13:17:30,830 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:30,830 INFO L354 BasicCegarLoop]: trace histogram [140, 1, 1, 1] [2018-07-25 13:17:30,830 INFO L415 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:30,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1278431873, now seen corresponding path program 140 times [2018-07-25 13:17:30,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:31,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:31,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 13:17:31,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 13:17:31,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 13:17:31,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:17:31,432 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 143 states. [2018-07-25 13:17:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:31,655 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 13:17:31,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 13:17:31,655 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 143 [2018-07-25 13:17:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:31,655 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:17:31,655 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:17:31,657 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:17:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:17:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:17:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:17:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 13:17:31,659 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-07-25 13:17:31,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:31,659 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 13:17:31,659 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 13:17:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 13:17:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:17:31,660 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:31,660 INFO L354 BasicCegarLoop]: trace histogram [141, 1, 1, 1] [2018-07-25 13:17:31,660 INFO L415 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:31,661 INFO L82 PathProgramCache]: Analyzing trace with hash 976680424, now seen corresponding path program 141 times [2018-07-25 13:17:31,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:32,247 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:32,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 13:17:32,247 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 13:17:32,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 13:17:32,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:17:32,252 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 144 states. [2018-07-25 13:17:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:32,359 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-25 13:17:32,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 13:17:32,359 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 144 [2018-07-25 13:17:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:32,359 INFO L225 Difference]: With dead ends: 148 [2018-07-25 13:17:32,359 INFO L226 Difference]: Without dead ends: 146 [2018-07-25 13:17:32,360 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:17:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-25 13:17:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-25 13:17:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 13:17:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 13:17:32,363 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-07-25 13:17:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:32,363 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 13:17:32,364 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 13:17:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 13:17:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 13:17:32,364 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:32,364 INFO L354 BasicCegarLoop]: trace histogram [142, 1, 1, 1] [2018-07-25 13:17:32,364 INFO L415 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:32,364 INFO L82 PathProgramCache]: Analyzing trace with hash 212320097, now seen corresponding path program 142 times [2018-07-25 13:17:32,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:33,087 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:33,087 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 13:17:33,087 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 13:17:33,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 13:17:33,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:17:33,092 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 145 states. [2018-07-25 13:17:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:33,352 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 13:17:33,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 13:17:33,352 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 145 [2018-07-25 13:17:33,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:33,352 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:17:33,352 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:17:33,353 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:17:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:17:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:17:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:17:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 13:17:33,355 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-07-25 13:17:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:33,356 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 13:17:33,356 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 13:17:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 13:17:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:17:33,356 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:33,356 INFO L354 BasicCegarLoop]: trace histogram [143, 1, 1, 1] [2018-07-25 13:17:33,356 INFO L415 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:33,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2008013560, now seen corresponding path program 143 times [2018-07-25 13:17:33,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:33,860 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:33,860 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 13:17:33,861 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 13:17:33,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 13:17:33,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:17:33,863 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 146 states. [2018-07-25 13:17:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:34,136 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 13:17:34,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 13:17:34,136 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 146 [2018-07-25 13:17:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:34,137 INFO L225 Difference]: With dead ends: 150 [2018-07-25 13:17:34,137 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 13:17:34,138 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:17:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 13:17:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-25 13:17:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 13:17:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-25 13:17:34,140 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-07-25 13:17:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:34,140 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-25 13:17:34,140 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 13:17:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-25 13:17:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-25 13:17:34,141 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:34,141 INFO L354 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2018-07-25 13:17:34,141 INFO L415 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:34,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2118880191, now seen corresponding path program 144 times [2018-07-25 13:17:34,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:34,661 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:34,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 13:17:34,661 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 13:17:34,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 13:17:34,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:17:34,664 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. [2018-07-25 13:17:34,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:34,926 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 13:17:34,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 13:17:34,926 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 147 [2018-07-25 13:17:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:34,926 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:17:34,926 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:17:34,927 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:17:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:17:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:17:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:17:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 13:17:34,930 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-07-25 13:17:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:34,930 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 13:17:34,930 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 13:17:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 13:17:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:17:34,931 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:34,931 INFO L354 BasicCegarLoop]: trace histogram [145, 1, 1, 1] [2018-07-25 13:17:34,931 INFO L415 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1260778456, now seen corresponding path program 145 times [2018-07-25 13:17:34,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:35,596 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:35,596 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 13:17:35,597 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 13:17:35,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 13:17:35,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:17:35,599 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 148 states. [2018-07-25 13:17:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:35,868 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-25 13:17:35,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 13:17:35,868 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 148 [2018-07-25 13:17:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:35,869 INFO L225 Difference]: With dead ends: 152 [2018-07-25 13:17:35,869 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 13:17:35,869 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:17:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 13:17:35,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-25 13:17:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 13:17:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-25 13:17:35,872 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-07-25 13:17:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:35,873 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-25 13:17:35,873 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 13:17:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-25 13:17:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-25 13:17:35,874 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:35,874 INFO L354 BasicCegarLoop]: trace histogram [146, 1, 1, 1] [2018-07-25 13:17:35,874 INFO L415 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash -429428447, now seen corresponding path program 146 times [2018-07-25 13:17:35,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:36,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:36,502 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 13:17:36,502 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 13:17:36,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 13:17:36,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:17:36,504 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 149 states. [2018-07-25 13:17:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:36,792 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 13:17:36,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 13:17:36,792 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 149 [2018-07-25 13:17:36,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:36,793 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:17:36,793 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:17:36,794 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:17:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:17:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:17:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:17:36,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 13:17:36,797 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-07-25 13:17:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:36,797 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 13:17:36,797 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 13:17:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 13:17:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:17:36,798 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:36,798 INFO L354 BasicCegarLoop]: trace histogram [147, 1, 1, 1] [2018-07-25 13:17:36,798 INFO L415 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:36,799 INFO L82 PathProgramCache]: Analyzing trace with hash -427381944, now seen corresponding path program 147 times [2018-07-25 13:17:36,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:37,370 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:37,370 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 13:17:37,371 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 13:17:37,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 13:17:37,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:17:37,373 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 150 states. [2018-07-25 13:17:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:37,691 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-25 13:17:37,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 13:17:37,691 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 150 [2018-07-25 13:17:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:37,692 INFO L225 Difference]: With dead ends: 154 [2018-07-25 13:17:37,692 INFO L226 Difference]: Without dead ends: 152 [2018-07-25 13:17:37,693 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:17:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-25 13:17:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-25 13:17:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 13:17:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-25 13:17:37,695 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-07-25 13:17:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:37,695 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-25 13:17:37,696 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 13:17:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-25 13:17:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-25 13:17:37,696 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:37,696 INFO L354 BasicCegarLoop]: trace histogram [148, 1, 1, 1] [2018-07-25 13:17:37,697 INFO L415 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:37,697 INFO L82 PathProgramCache]: Analyzing trace with hash -363940351, now seen corresponding path program 148 times [2018-07-25 13:17:37,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:38,258 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:38,258 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 13:17:38,259 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 13:17:38,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 13:17:38,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:17:38,263 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 151 states. [2018-07-25 13:17:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:38,614 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 13:17:38,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 13:17:38,614 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 151 [2018-07-25 13:17:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:38,615 INFO L225 Difference]: With dead ends: 155 [2018-07-25 13:17:38,615 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:17:38,616 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:17:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:17:38,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:17:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:17:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 13:17:38,618 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-07-25 13:17:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:38,618 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 13:17:38,618 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 13:17:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 13:17:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:17:38,619 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:38,619 INFO L354 BasicCegarLoop]: trace histogram [149, 1, 1, 1] [2018-07-25 13:17:38,619 INFO L415 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:38,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1602749032, now seen corresponding path program 149 times [2018-07-25 13:17:38,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:39,200 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:39,200 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 13:17:39,200 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 13:17:39,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 13:17:39,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:17:39,203 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 152 states. [2018-07-25 13:17:39,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:39,558 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-25 13:17:39,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 13:17:39,559 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 152 [2018-07-25 13:17:39,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:39,559 INFO L225 Difference]: With dead ends: 156 [2018-07-25 13:17:39,559 INFO L226 Difference]: Without dead ends: 154 [2018-07-25 13:17:39,560 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:17:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-25 13:17:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-07-25 13:17:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-25 13:17:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-07-25 13:17:39,563 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-07-25 13:17:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:39,563 INFO L472 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-07-25 13:17:39,563 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 13:17:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-07-25 13:17:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-25 13:17:39,564 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:39,564 INFO L354 BasicCegarLoop]: trace histogram [150, 1, 1, 1] [2018-07-25 13:17:39,564 INFO L415 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:39,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1854389535, now seen corresponding path program 150 times [2018-07-25 13:17:39,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:40,152 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:40,152 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 13:17:40,152 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 13:17:40,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 13:17:40,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:17:40,155 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 153 states. [2018-07-25 13:17:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:40,514 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 13:17:40,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 13:17:40,515 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 153 [2018-07-25 13:17:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:40,515 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:17:40,515 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:17:40,517 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:17:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:17:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 13:17:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 13:17:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 13:17:40,520 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-07-25 13:17:40,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:40,521 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 13:17:40,521 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 13:17:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 13:17:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 13:17:40,521 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:40,522 INFO L354 BasicCegarLoop]: trace histogram [151, 1, 1, 1] [2018-07-25 13:17:40,522 INFO L415 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1651502712, now seen corresponding path program 151 times [2018-07-25 13:17:40,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:41,090 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:41,091 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 13:17:41,091 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 13:17:41,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 13:17:41,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:17:41,094 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 154 states. [2018-07-25 13:17:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:41,434 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-07-25 13:17:41,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 13:17:41,435 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 154 [2018-07-25 13:17:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:41,435 INFO L225 Difference]: With dead ends: 158 [2018-07-25 13:17:41,435 INFO L226 Difference]: Without dead ends: 156 [2018-07-25 13:17:41,436 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:17:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-07-25 13:17:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-07-25 13:17:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-25 13:17:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-07-25 13:17:41,438 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-07-25 13:17:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:41,439 INFO L472 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-07-25 13:17:41,439 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 13:17:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-07-25 13:17:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-25 13:17:41,439 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:41,439 INFO L354 BasicCegarLoop]: trace histogram [152, 1, 1, 1] [2018-07-25 13:17:41,439 INFO L415 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:41,440 INFO L82 PathProgramCache]: Analyzing trace with hash 343021505, now seen corresponding path program 152 times [2018-07-25 13:17:41,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:42,043 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:42,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 13:17:42,043 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 13:17:42,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 13:17:42,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:17:42,046 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 155 states. [2018-07-25 13:17:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:42,385 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 13:17:42,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 13:17:42,386 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 155 [2018-07-25 13:17:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:42,386 INFO L225 Difference]: With dead ends: 159 [2018-07-25 13:17:42,386 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:17:42,387 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:17:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:17:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 13:17:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 13:17:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 13:17:42,391 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-07-25 13:17:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:42,391 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 13:17:42,391 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 13:17:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 13:17:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 13:17:42,392 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:42,392 INFO L354 BasicCegarLoop]: trace histogram [153, 1, 1, 1] [2018-07-25 13:17:42,392 INFO L415 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:42,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2043730088, now seen corresponding path program 153 times [2018-07-25 13:17:42,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:43,016 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:43,016 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 13:17:43,016 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 13:17:43,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 13:17:43,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:17:43,019 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 156 states. [2018-07-25 13:17:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:43,349 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-07-25 13:17:43,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 13:17:43,349 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 156 [2018-07-25 13:17:43,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:43,349 INFO L225 Difference]: With dead ends: 160 [2018-07-25 13:17:43,349 INFO L226 Difference]: Without dead ends: 158 [2018-07-25 13:17:43,351 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:17:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-25 13:17:43,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-07-25 13:17:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-25 13:17:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-07-25 13:17:43,353 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-07-25 13:17:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:43,353 INFO L472 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-07-25 13:17:43,353 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 13:17:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-07-25 13:17:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-25 13:17:43,354 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:43,354 INFO L354 BasicCegarLoop]: trace histogram [154, 1, 1, 1] [2018-07-25 13:17:43,354 INFO L415 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:43,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1068878687, now seen corresponding path program 154 times [2018-07-25 13:17:43,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:44,095 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:44,095 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 13:17:44,095 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 13:17:44,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 13:17:44,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:17:44,097 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 157 states. [2018-07-25 13:17:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:44,533 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 13:17:44,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 13:17:44,533 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 157 [2018-07-25 13:17:44,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:44,533 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:17:44,533 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:17:44,535 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:17:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:17:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 13:17:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 13:17:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 13:17:44,537 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-07-25 13:17:44,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:44,537 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 13:17:44,537 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 13:17:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 13:17:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 13:17:44,538 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:44,538 INFO L354 BasicCegarLoop]: trace histogram [155, 1, 1, 1] [2018-07-25 13:17:44,538 INFO L415 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:44,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1224497096, now seen corresponding path program 155 times [2018-07-25 13:17:44,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:45,269 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:45,269 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 13:17:45,270 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 13:17:45,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 13:17:45,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:17:45,273 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 158 states. [2018-07-25 13:17:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:45,608 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-07-25 13:17:45,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 13:17:45,608 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 158 [2018-07-25 13:17:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:45,609 INFO L225 Difference]: With dead ends: 162 [2018-07-25 13:17:45,609 INFO L226 Difference]: Without dead ends: 160 [2018-07-25 13:17:45,611 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:17:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-07-25 13:17:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-07-25 13:17:45,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-25 13:17:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-07-25 13:17:45,613 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-07-25 13:17:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:45,613 INFO L472 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-07-25 13:17:45,613 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 13:17:45,613 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-07-25 13:17:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-25 13:17:45,614 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:45,614 INFO L354 BasicCegarLoop]: trace histogram [156, 1, 1, 1] [2018-07-25 13:17:45,614 INFO L415 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:45,614 INFO L82 PathProgramCache]: Analyzing trace with hash -695297663, now seen corresponding path program 156 times [2018-07-25 13:17:45,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:46,343 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:46,344 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 13:17:46,344 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 13:17:46,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 13:17:46,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:17:46,347 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 159 states. [2018-07-25 13:17:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:46,506 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 13:17:46,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 13:17:46,506 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 159 [2018-07-25 13:17:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:46,507 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:17:46,507 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:17:46,509 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:17:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:17:46,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 13:17:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:17:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 13:17:46,511 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-07-25 13:17:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:46,511 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 13:17:46,511 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 13:17:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 13:17:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:17:46,512 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:46,512 INFO L354 BasicCegarLoop]: trace histogram [157, 1, 1, 1] [2018-07-25 13:17:46,512 INFO L415 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:46,512 INFO L82 PathProgramCache]: Analyzing trace with hash -79393048, now seen corresponding path program 157 times [2018-07-25 13:17:46,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:47,245 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:47,245 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 13:17:47,245 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 13:17:47,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 13:17:47,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:17:47,250 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 160 states. [2018-07-25 13:17:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:47,519 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-07-25 13:17:47,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 13:17:47,519 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 160 [2018-07-25 13:17:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:47,519 INFO L225 Difference]: With dead ends: 164 [2018-07-25 13:17:47,519 INFO L226 Difference]: Without dead ends: 162 [2018-07-25 13:17:47,521 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:17:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-25 13:17:47,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-07-25 13:17:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-25 13:17:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-07-25 13:17:47,524 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-07-25 13:17:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:47,524 INFO L472 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-07-25 13:17:47,524 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 13:17:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-07-25 13:17:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-25 13:17:47,524 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:47,525 INFO L354 BasicCegarLoop]: trace histogram [158, 1, 1, 1] [2018-07-25 13:17:47,525 INFO L415 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1833780833, now seen corresponding path program 158 times [2018-07-25 13:17:47,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:48,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:48,254 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 13:17:48,254 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 13:17:48,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 13:17:48,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:17:48,256 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 161 states. [2018-07-25 13:17:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:48,667 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 13:17:48,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 13:17:48,667 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 161 [2018-07-25 13:17:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:48,668 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:17:48,668 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:17:48,669 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:17:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:17:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 13:17:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:17:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 13:17:48,671 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-07-25 13:17:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:48,672 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 13:17:48,672 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 13:17:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 13:17:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 13:17:48,672 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:48,673 INFO L354 BasicCegarLoop]: trace histogram [159, 1, 1, 1] [2018-07-25 13:17:48,673 INFO L415 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:48,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1012629000, now seen corresponding path program 159 times [2018-07-25 13:17:48,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:49,414 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:49,414 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 13:17:49,414 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 13:17:49,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 13:17:49,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:17:49,418 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 162 states. [2018-07-25 13:17:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:49,965 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-07-25 13:17:49,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 13:17:49,965 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 162 [2018-07-25 13:17:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:49,966 INFO L225 Difference]: With dead ends: 166 [2018-07-25 13:17:49,966 INFO L226 Difference]: Without dead ends: 164 [2018-07-25 13:17:49,967 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:17:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-25 13:17:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-07-25 13:17:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-25 13:17:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-07-25 13:17:49,970 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-07-25 13:17:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:49,971 INFO L472 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-07-25 13:17:49,971 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 13:17:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-07-25 13:17:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-25 13:17:49,972 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:49,972 INFO L354 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2018-07-25 13:17:49,972 INFO L415 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1326725953, now seen corresponding path program 160 times [2018-07-25 13:17:49,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:50,718 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:50,718 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 13:17:50,719 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 13:17:50,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 13:17:50,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:17:50,722 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 163 states. [2018-07-25 13:17:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:51,243 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 13:17:51,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 13:17:51,244 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 163 [2018-07-25 13:17:51,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:51,244 INFO L225 Difference]: With dead ends: 167 [2018-07-25 13:17:51,244 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:17:51,246 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:17:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:17:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 13:17:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 13:17:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 13:17:51,249 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-07-25 13:17:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:51,249 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 13:17:51,249 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 13:17:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 13:17:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 13:17:51,250 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:51,250 INFO L354 BasicCegarLoop]: trace histogram [161, 1, 1, 1] [2018-07-25 13:17:51,250 INFO L415 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1821170392, now seen corresponding path program 161 times [2018-07-25 13:17:51,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:52,059 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:52,059 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 13:17:52,059 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 13:17:52,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 13:17:52,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:17:52,063 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 164 states. [2018-07-25 13:17:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:52,256 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-07-25 13:17:52,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 13:17:52,256 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 164 [2018-07-25 13:17:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:52,257 INFO L225 Difference]: With dead ends: 168 [2018-07-25 13:17:52,257 INFO L226 Difference]: Without dead ends: 166 [2018-07-25 13:17:52,260 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:17:52,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-25 13:17:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-07-25 13:17:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 13:17:52,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-07-25 13:17:52,263 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-07-25 13:17:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:52,263 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-07-25 13:17:52,263 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 13:17:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-07-25 13:17:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-25 13:17:52,264 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:52,264 INFO L354 BasicCegarLoop]: trace histogram [162, 1, 1, 1] [2018-07-25 13:17:52,264 INFO L415 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:52,265 INFO L82 PathProgramCache]: Analyzing trace with hash -621709279, now seen corresponding path program 162 times [2018-07-25 13:17:52,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:53,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:53,173 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 13:17:53,173 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 13:17:53,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 13:17:53,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:17:53,176 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 165 states. [2018-07-25 13:17:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:53,555 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 13:17:53,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 13:17:53,556 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 165 [2018-07-25 13:17:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:53,556 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:17:53,556 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:17:53,558 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:17:53,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:17:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 13:17:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:17:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 13:17:53,560 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-07-25 13:17:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:53,560 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 13:17:53,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 13:17:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 13:17:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 13:17:53,561 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:53,561 INFO L354 BasicCegarLoop]: trace histogram [163, 1, 1, 1] [2018-07-25 13:17:53,561 INFO L415 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:53,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2093120440, now seen corresponding path program 163 times [2018-07-25 13:17:53,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:54,330 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:54,330 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 13:17:54,330 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 13:17:54,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 13:17:54,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:17:54,334 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 166 states. [2018-07-25 13:17:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:54,976 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-07-25 13:17:54,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 13:17:54,977 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 166 [2018-07-25 13:17:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:54,977 INFO L225 Difference]: With dead ends: 170 [2018-07-25 13:17:54,977 INFO L226 Difference]: Without dead ends: 168 [2018-07-25 13:17:54,979 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:17:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-07-25 13:17:54,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-07-25 13:17:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-25 13:17:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-07-25 13:17:54,982 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-07-25 13:17:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:54,982 INFO L472 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-07-25 13:17:54,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 13:17:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-07-25 13:17:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-07-25 13:17:54,983 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:54,983 INFO L354 BasicCegarLoop]: trace histogram [164, 1, 1, 1] [2018-07-25 13:17:54,983 INFO L415 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:54,983 INFO L82 PathProgramCache]: Analyzing trace with hash -462226175, now seen corresponding path program 164 times [2018-07-25 13:17:54,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:55,770 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:55,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 13:17:55,770 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 13:17:55,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 13:17:55,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:17:55,774 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 167 states. [2018-07-25 13:17:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:56,267 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 13:17:56,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 13:17:56,267 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 167 [2018-07-25 13:17:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:56,267 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:17:56,267 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:17:56,270 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:17:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:17:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 13:17:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 13:17:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 13:17:56,272 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-07-25 13:17:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:56,272 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 13:17:56,272 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 13:17:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 13:17:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 13:17:56,273 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:56,273 INFO L354 BasicCegarLoop]: trace histogram [165, 1, 1, 1] [2018-07-25 13:17:56,273 INFO L415 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:56,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1444111512, now seen corresponding path program 165 times [2018-07-25 13:17:56,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:57,044 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:57,045 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 13:17:57,045 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 13:17:57,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 13:17:57,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:17:57,049 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 168 states. [2018-07-25 13:17:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:57,266 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-07-25 13:17:57,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 13:17:57,266 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 168 [2018-07-25 13:17:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:57,267 INFO L225 Difference]: With dead ends: 172 [2018-07-25 13:17:57,267 INFO L226 Difference]: Without dead ends: 170 [2018-07-25 13:17:57,268 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:17:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-25 13:17:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-07-25 13:17:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-25 13:17:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-07-25 13:17:57,271 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-07-25 13:17:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:57,271 INFO L472 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-07-25 13:17:57,271 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 13:17:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-07-25 13:17:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-25 13:17:57,272 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:57,272 INFO L354 BasicCegarLoop]: trace histogram [166, 1, 1, 1] [2018-07-25 13:17:57,272 INFO L415 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:57,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1817785887, now seen corresponding path program 166 times [2018-07-25 13:17:57,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:57,979 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:57,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 13:17:57,979 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 13:17:57,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 13:17:57,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:17:57,983 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 169 states. [2018-07-25 13:17:58,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:58,510 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 13:17:58,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 13:17:58,510 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 169 [2018-07-25 13:17:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:58,510 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:17:58,510 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:17:58,512 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:17:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:17:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 13:17:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:17:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 13:17:58,514 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-07-25 13:17:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:58,514 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 13:17:58,514 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 13:17:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 13:17:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:17:58,515 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:58,515 INFO L354 BasicCegarLoop]: trace histogram [167, 1, 1, 1] [2018-07-25 13:17:58,515 INFO L415 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:58,515 INFO L82 PathProgramCache]: Analyzing trace with hash -516789624, now seen corresponding path program 167 times [2018-07-25 13:17:58,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:59,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:59,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 13:17:59,364 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 13:17:59,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 13:17:59,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:17:59,369 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 170 states. [2018-07-25 13:17:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:59,905 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-07-25 13:17:59,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 13:17:59,906 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 170 [2018-07-25 13:17:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:59,906 INFO L225 Difference]: With dead ends: 174 [2018-07-25 13:17:59,906 INFO L226 Difference]: Without dead ends: 172 [2018-07-25 13:17:59,909 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:17:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-07-25 13:17:59,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-07-25 13:17:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-25 13:17:59,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-07-25 13:17:59,911 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-07-25 13:17:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:59,911 INFO L472 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-07-25 13:17:59,911 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 13:17:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-07-25 13:17:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-25 13:17:59,912 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:59,912 INFO L354 BasicCegarLoop]: trace histogram [168, 1, 1, 1] [2018-07-25 13:17:59,912 INFO L415 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:59,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1159388865, now seen corresponding path program 168 times [2018-07-25 13:17:59,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:00,772 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:00,773 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 13:18:00,773 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 13:18:00,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 13:18:00,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:18:00,777 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 171 states. [2018-07-25 13:18:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:01,089 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 13:18:01,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 13:18:01,089 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 171 [2018-07-25 13:18:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:01,090 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:18:01,090 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:18:01,092 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:18:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:18:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 13:18:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:18:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 13:18:01,095 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-07-25 13:18:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:01,095 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 13:18:01,095 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 13:18:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 13:18:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 13:18:01,096 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:01,096 INFO L354 BasicCegarLoop]: trace histogram [169, 1, 1, 1] [2018-07-25 13:18:01,096 INFO L415 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:01,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1581314472, now seen corresponding path program 169 times [2018-07-25 13:18:01,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:01,889 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:01,889 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 13:18:01,889 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 13:18:01,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 13:18:01,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:18:01,892 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 172 states. [2018-07-25 13:18:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:02,426 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-07-25 13:18:02,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 13:18:02,427 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 172 [2018-07-25 13:18:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:02,427 INFO L225 Difference]: With dead ends: 176 [2018-07-25 13:18:02,427 INFO L226 Difference]: Without dead ends: 174 [2018-07-25 13:18:02,428 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:18:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-25 13:18:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-07-25 13:18:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-25 13:18:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-07-25 13:18:02,430 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-07-25 13:18:02,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:02,431 INFO L472 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-07-25 13:18:02,431 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 13:18:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-07-25 13:18:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-25 13:18:02,431 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:02,431 INFO L354 BasicCegarLoop]: trace histogram [170, 1, 1, 1] [2018-07-25 13:18:02,431 INFO L415 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:02,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1776106401, now seen corresponding path program 170 times [2018-07-25 13:18:02,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:03,178 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:03,179 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 13:18:03,179 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 13:18:03,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 13:18:03,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:18:03,185 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 173 states. [2018-07-25 13:18:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:03,447 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 13:18:03,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 13:18:03,447 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 173 [2018-07-25 13:18:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:03,448 INFO L225 Difference]: With dead ends: 177 [2018-07-25 13:18:03,448 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:18:03,451 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:18:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:18:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 13:18:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 13:18:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 13:18:03,453 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-07-25 13:18:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:03,454 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 13:18:03,454 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 13:18:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 13:18:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 13:18:03,455 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:03,455 INFO L354 BasicCegarLoop]: trace histogram [171, 1, 1, 1] [2018-07-25 13:18:03,455 INFO L415 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:03,455 INFO L82 PathProgramCache]: Analyzing trace with hash -775278392, now seen corresponding path program 171 times [2018-07-25 13:18:03,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:04,327 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:04,327 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 13:18:04,328 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 13:18:04,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 13:18:04,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:18:04,332 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 174 states. [2018-07-25 13:18:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:04,976 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-07-25 13:18:04,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 13:18:04,976 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 174 [2018-07-25 13:18:04,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:04,976 INFO L225 Difference]: With dead ends: 178 [2018-07-25 13:18:04,977 INFO L226 Difference]: Without dead ends: 176 [2018-07-25 13:18:04,980 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:18:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-25 13:18:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-07-25 13:18:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-25 13:18:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-07-25 13:18:04,982 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-07-25 13:18:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:04,982 INFO L472 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-07-25 13:18:04,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 13:18:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-07-25 13:18:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-25 13:18:04,983 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:04,983 INFO L354 BasicCegarLoop]: trace histogram [172, 1, 1, 1] [2018-07-25 13:18:04,983 INFO L415 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:04,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1736171649, now seen corresponding path program 172 times [2018-07-25 13:18:04,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:05,934 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:05,934 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-25 13:18:05,934 INFO L451 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-25 13:18:05,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-25 13:18:05,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:18:05,936 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 175 states. [2018-07-25 13:18:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:06,289 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 13:18:06,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-25 13:18:06,289 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 175 [2018-07-25 13:18:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:06,290 INFO L225 Difference]: With dead ends: 179 [2018-07-25 13:18:06,290 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:18:06,291 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:18:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:18:06,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 13:18:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 13:18:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 13:18:06,293 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-07-25 13:18:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:06,294 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 13:18:06,294 INFO L473 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-25 13:18:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 13:18:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 13:18:06,295 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:06,295 INFO L354 BasicCegarLoop]: trace histogram [173, 1, 1, 1] [2018-07-25 13:18:06,295 INFO L415 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:06,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2013255704, now seen corresponding path program 173 times [2018-07-25 13:18:06,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:07,152 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:07,152 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-25 13:18:07,152 INFO L451 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-25 13:18:07,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-25 13:18:07,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:18:07,157 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 176 states. [2018-07-25 13:18:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:07,764 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-07-25 13:18:07,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 13:18:07,764 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 176 [2018-07-25 13:18:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:07,764 INFO L225 Difference]: With dead ends: 180 [2018-07-25 13:18:07,764 INFO L226 Difference]: Without dead ends: 178 [2018-07-25 13:18:07,766 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:18:07,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-25 13:18:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-07-25 13:18:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-25 13:18:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-07-25 13:18:07,768 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2018-07-25 13:18:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:07,769 INFO L472 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-07-25 13:18:07,769 INFO L473 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-25 13:18:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-07-25 13:18:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-25 13:18:07,769 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:07,769 INFO L354 BasicCegarLoop]: trace histogram [174, 1, 1, 1] [2018-07-25 13:18:07,769 INFO L415 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:07,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2013580641, now seen corresponding path program 174 times [2018-07-25 13:18:07,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:08,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:08,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-25 13:18:08,541 INFO L451 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-25 13:18:08,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-25 13:18:08,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:18:08,544 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 177 states. [2018-07-25 13:18:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:09,004 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 13:18:09,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-25 13:18:09,004 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 177 [2018-07-25 13:18:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:09,005 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:18:09,005 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:18:09,008 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:18:09,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:18:09,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 13:18:09,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:18:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 13:18:09,011 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2018-07-25 13:18:09,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:09,011 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 13:18:09,011 INFO L473 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-25 13:18:09,011 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 13:18:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 13:18:09,012 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:09,012 INFO L354 BasicCegarLoop]: trace histogram [175, 1, 1, 1] [2018-07-25 13:18:09,012 INFO L415 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2003511544, now seen corresponding path program 175 times [2018-07-25 13:18:09,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:09,838 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:09,838 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-07-25 13:18:09,838 INFO L451 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-07-25 13:18:09,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-07-25 13:18:09,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:18:09,842 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 178 states. [2018-07-25 13:18:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:10,315 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-07-25 13:18:10,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-07-25 13:18:10,315 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 178 [2018-07-25 13:18:10,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:10,316 INFO L225 Difference]: With dead ends: 182 [2018-07-25 13:18:10,316 INFO L226 Difference]: Without dead ends: 180 [2018-07-25 13:18:10,317 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:18:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-25 13:18:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-07-25 13:18:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-25 13:18:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-07-25 13:18:10,319 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 178 [2018-07-25 13:18:10,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:10,320 INFO L472 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-07-25 13:18:10,320 INFO L473 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-07-25 13:18:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-07-25 13:18:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-25 13:18:10,320 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:10,320 INFO L354 BasicCegarLoop]: trace histogram [176, 1, 1, 1] [2018-07-25 13:18:10,320 INFO L415 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:10,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1979317695, now seen corresponding path program 176 times [2018-07-25 13:18:10,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:11,155 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:11,156 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-07-25 13:18:11,156 INFO L451 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-07-25 13:18:11,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-07-25 13:18:11,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:18:11,160 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 179 states. [2018-07-25 13:18:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:11,595 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 13:18:11,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-07-25 13:18:11,596 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 179 [2018-07-25 13:18:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:11,596 INFO L225 Difference]: With dead ends: 183 [2018-07-25 13:18:11,596 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:18:11,598 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:18:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:18:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:18:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:18:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 13:18:11,600 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 179 [2018-07-25 13:18:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:11,600 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 13:18:11,600 INFO L473 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-07-25 13:18:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 13:18:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:18:11,601 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:11,601 INFO L354 BasicCegarLoop]: trace histogram [177, 1, 1, 1] [2018-07-25 13:18:11,601 INFO L415 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:11,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1229308376, now seen corresponding path program 177 times [2018-07-25 13:18:11,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:12,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:12,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-07-25 13:18:12,447 INFO L451 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-07-25 13:18:12,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-07-25 13:18:12,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:18:12,451 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 180 states. [2018-07-25 13:18:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:13,087 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-07-25 13:18:13,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-07-25 13:18:13,087 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 180 [2018-07-25 13:18:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:13,088 INFO L225 Difference]: With dead ends: 184 [2018-07-25 13:18:13,088 INFO L226 Difference]: Without dead ends: 182 [2018-07-25 13:18:13,092 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:18:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-25 13:18:13,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-25 13:18:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-25 13:18:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-07-25 13:18:13,095 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 180 [2018-07-25 13:18:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:13,095 INFO L472 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-07-25 13:18:13,095 INFO L473 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-07-25 13:18:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-07-25 13:18:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-07-25 13:18:13,096 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:13,096 INFO L354 BasicCegarLoop]: trace histogram [178, 1, 1, 1] [2018-07-25 13:18:13,096 INFO L415 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash 546144033, now seen corresponding path program 178 times [2018-07-25 13:18:13,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:13,934 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:13,935 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-07-25 13:18:13,935 INFO L451 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-07-25 13:18:13,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-07-25 13:18:13,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:18:13,939 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 181 states. [2018-07-25 13:18:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:14,227 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 13:18:14,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-07-25 13:18:14,228 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 181 [2018-07-25 13:18:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:14,228 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:18:14,228 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:18:14,230 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:18:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:18:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:18:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:18:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 13:18:14,232 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 181 [2018-07-25 13:18:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:14,233 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 13:18:14,233 INFO L473 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-07-25 13:18:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 13:18:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 13:18:14,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:14,234 INFO L354 BasicCegarLoop]: trace histogram [179, 1, 1, 1] [2018-07-25 13:18:14,234 INFO L415 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash -249406136, now seen corresponding path program 179 times [2018-07-25 13:18:14,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:15,085 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:15,086 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-07-25 13:18:15,086 INFO L451 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-07-25 13:18:15,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-07-25 13:18:15,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 13:18:15,090 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 182 states. [2018-07-25 13:18:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:15,791 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-07-25 13:18:15,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-07-25 13:18:15,791 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 182 [2018-07-25 13:18:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:15,792 INFO L225 Difference]: With dead ends: 186 [2018-07-25 13:18:15,792 INFO L226 Difference]: Without dead ends: 184 [2018-07-25 13:18:15,795 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 13:18:15,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-25 13:18:15,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-07-25 13:18:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-25 13:18:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-07-25 13:18:15,797 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 182 [2018-07-25 13:18:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:15,797 INFO L472 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-07-25 13:18:15,797 INFO L473 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-07-25 13:18:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-07-25 13:18:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-25 13:18:15,798 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:15,798 INFO L354 BasicCegarLoop]: trace histogram [180, 1, 1, 1] [2018-07-25 13:18:15,798 INFO L415 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:15,798 INFO L82 PathProgramCache]: Analyzing trace with hash 858342401, now seen corresponding path program 180 times [2018-07-25 13:18:15,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:16,652 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:16,652 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-07-25 13:18:16,652 INFO L451 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-07-25 13:18:16,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-07-25 13:18:16,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:18:16,656 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 183 states. [2018-07-25 13:18:16,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:16,896 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 13:18:16,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-07-25 13:18:16,896 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 183 [2018-07-25 13:18:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:16,896 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:18:16,897 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:18:16,900 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:18:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:18:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 13:18:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:18:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 13:18:16,903 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 183 [2018-07-25 13:18:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:16,904 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 13:18:16,904 INFO L473 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-07-25 13:18:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 13:18:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 13:18:16,904 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:16,905 INFO L354 BasicCegarLoop]: trace histogram [181, 1, 1, 1] [2018-07-25 13:18:16,905 INFO L415 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:16,905 INFO L82 PathProgramCache]: Analyzing trace with hash 838808680, now seen corresponding path program 181 times [2018-07-25 13:18:16,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:17,832 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:17,832 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-07-25 13:18:17,833 INFO L451 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-07-25 13:18:17,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-07-25 13:18:17,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:18:17,837 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 184 states. [2018-07-25 13:18:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:18,456 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-07-25 13:18:18,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-07-25 13:18:18,456 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 184 [2018-07-25 13:18:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:18,457 INFO L225 Difference]: With dead ends: 188 [2018-07-25 13:18:18,457 INFO L226 Difference]: Without dead ends: 186 [2018-07-25 13:18:18,459 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:18:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-07-25 13:18:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-07-25 13:18:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-07-25 13:18:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-07-25 13:18:18,461 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 184 [2018-07-25 13:18:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:18,461 INFO L472 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-07-25 13:18:18,461 INFO L473 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-07-25 13:18:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-07-25 13:18:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-07-25 13:18:18,462 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:18,462 INFO L354 BasicCegarLoop]: trace histogram [182, 1, 1, 1] [2018-07-25 13:18:18,462 INFO L415 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash 233263329, now seen corresponding path program 182 times [2018-07-25 13:18:18,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:19,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:19,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-07-25 13:18:19,368 INFO L451 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-07-25 13:18:19,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-07-25 13:18:19,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:18:19,372 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 185 states. [2018-07-25 13:18:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:20,065 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 13:18:20,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-07-25 13:18:20,065 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 185 [2018-07-25 13:18:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:20,066 INFO L225 Difference]: With dead ends: 189 [2018-07-25 13:18:20,066 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:18:20,068 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:18:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:18:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 13:18:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 13:18:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 13:18:20,070 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 185 [2018-07-25 13:18:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:20,071 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 13:18:20,071 INFO L473 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-07-25 13:18:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 13:18:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 13:18:20,071 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:20,071 INFO L354 BasicCegarLoop]: trace histogram [183, 1, 1, 1] [2018-07-25 13:18:20,071 INFO L415 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:20,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1358773368, now seen corresponding path program 183 times [2018-07-25 13:18:20,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:20,947 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:20,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-07-25 13:18:20,948 INFO L451 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-07-25 13:18:20,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-07-25 13:18:20,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 13:18:20,952 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 186 states. [2018-07-25 13:18:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:21,164 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-07-25 13:18:21,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-07-25 13:18:21,165 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 186 [2018-07-25 13:18:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:21,165 INFO L225 Difference]: With dead ends: 190 [2018-07-25 13:18:21,165 INFO L226 Difference]: Without dead ends: 188 [2018-07-25 13:18:21,167 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 13:18:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-07-25 13:18:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-07-25 13:18:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-07-25 13:18:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-07-25 13:18:21,169 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 186 [2018-07-25 13:18:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:21,170 INFO L472 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-07-25 13:18:21,170 INFO L473 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-07-25 13:18:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-07-25 13:18:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-07-25 13:18:21,170 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:21,170 INFO L354 BasicCegarLoop]: trace histogram [184, 1, 1, 1] [2018-07-25 13:18:21,170 INFO L415 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:21,171 INFO L82 PathProgramCache]: Analyzing trace with hash 827696577, now seen corresponding path program 184 times [2018-07-25 13:18:21,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:22,077 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:22,077 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-07-25 13:18:22,078 INFO L451 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-07-25 13:18:22,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-07-25 13:18:22,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:18:22,082 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 187 states. [2018-07-25 13:18:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:22,761 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 13:18:22,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-07-25 13:18:22,761 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 187 [2018-07-25 13:18:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:22,762 INFO L225 Difference]: With dead ends: 191 [2018-07-25 13:18:22,762 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:18:22,764 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:18:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:18:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 13:18:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 13:18:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 13:18:22,766 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 187 [2018-07-25 13:18:22,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:22,766 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 13:18:22,766 INFO L473 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-07-25 13:18:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 13:18:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 13:18:22,767 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:22,767 INFO L354 BasicCegarLoop]: trace histogram [185, 1, 1, 1] [2018-07-25 13:18:22,767 INFO L415 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash -111211864, now seen corresponding path program 185 times [2018-07-25 13:18:22,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:23,711 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:23,711 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-07-25 13:18:23,711 INFO L451 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-07-25 13:18:23,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-07-25 13:18:23,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 13:18:23,716 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 188 states. [2018-07-25 13:18:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:24,538 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-07-25 13:18:24,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-07-25 13:18:24,538 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 188 [2018-07-25 13:18:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:24,539 INFO L225 Difference]: With dead ends: 192 [2018-07-25 13:18:24,539 INFO L226 Difference]: Without dead ends: 190 [2018-07-25 13:18:24,541 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 13:18:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-07-25 13:18:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-07-25 13:18:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-25 13:18:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-07-25 13:18:24,543 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 188 [2018-07-25 13:18:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:24,543 INFO L472 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-07-25 13:18:24,543 INFO L473 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-07-25 13:18:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-07-25 13:18:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-07-25 13:18:24,544 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:24,544 INFO L354 BasicCegarLoop]: trace histogram [186, 1, 1, 1] [2018-07-25 13:18:24,544 INFO L415 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:24,544 INFO L82 PathProgramCache]: Analyzing trace with hash 847397537, now seen corresponding path program 186 times [2018-07-25 13:18:24,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:25,549 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:25,549 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-07-25 13:18:25,549 INFO L451 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-07-25 13:18:25,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-07-25 13:18:25,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:18:25,554 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 189 states. [2018-07-25 13:18:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:25,852 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 13:18:25,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-07-25 13:18:25,853 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 189 [2018-07-25 13:18:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:25,853 INFO L225 Difference]: With dead ends: 193 [2018-07-25 13:18:25,853 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 13:18:25,855 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:18:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 13:18:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 13:18:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 13:18:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 13:18:25,857 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 189 [2018-07-25 13:18:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:25,858 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 13:18:25,858 INFO L473 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-07-25 13:18:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 13:18:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 13:18:25,858 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:25,858 INFO L354 BasicCegarLoop]: trace histogram [187, 1, 1, 1] [2018-07-25 13:18:25,859 INFO L415 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:25,859 INFO L82 PathProgramCache]: Analyzing trace with hash 499517896, now seen corresponding path program 187 times [2018-07-25 13:18:25,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:26,814 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:26,814 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-07-25 13:18:26,814 INFO L451 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-07-25 13:18:26,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-07-25 13:18:26,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 13:18:26,821 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 190 states. [2018-07-25 13:18:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:27,170 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-07-25 13:18:27,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-07-25 13:18:27,170 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 190 [2018-07-25 13:18:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:27,171 INFO L225 Difference]: With dead ends: 194 [2018-07-25 13:18:27,171 INFO L226 Difference]: Without dead ends: 192 [2018-07-25 13:18:27,172 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 13:18:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-07-25 13:18:27,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-07-25 13:18:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-07-25 13:18:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-07-25 13:18:27,174 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 190 [2018-07-25 13:18:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:27,174 INFO L472 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-07-25 13:18:27,174 INFO L473 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-07-25 13:18:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-07-25 13:18:27,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-07-25 13:18:27,175 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:27,175 INFO L354 BasicCegarLoop]: trace histogram [188, 1, 1, 1] [2018-07-25 13:18:27,175 INFO L415 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:27,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1694816383, now seen corresponding path program 188 times [2018-07-25 13:18:27,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:28,163 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:28,163 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-07-25 13:18:28,163 INFO L451 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-07-25 13:18:28,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-07-25 13:18:28,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 13:18:28,169 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 191 states. [2018-07-25 13:18:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:29,218 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 13:18:29,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-07-25 13:18:29,218 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 191 [2018-07-25 13:18:29,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:29,219 INFO L225 Difference]: With dead ends: 195 [2018-07-25 13:18:29,219 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 13:18:29,223 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 13:18:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 13:18:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 13:18:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 13:18:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 13:18:29,227 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 191 [2018-07-25 13:18:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:29,227 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 13:18:29,228 INFO L473 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-07-25 13:18:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 13:18:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 13:18:29,228 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:29,229 INFO L354 BasicCegarLoop]: trace histogram [189, 1, 1, 1] [2018-07-25 13:18:29,229 INFO L415 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:29,229 INFO L82 PathProgramCache]: Analyzing trace with hash -999702296, now seen corresponding path program 189 times [2018-07-25 13:18:29,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:30,541 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:30,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-07-25 13:18:30,541 INFO L451 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-07-25 13:18:30,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-07-25 13:18:30,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 13:18:30,547 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 192 states. [2018-07-25 13:18:31,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:31,709 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-07-25 13:18:31,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-07-25 13:18:31,710 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 192 [2018-07-25 13:18:31,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:31,710 INFO L225 Difference]: With dead ends: 196 [2018-07-25 13:18:31,710 INFO L226 Difference]: Without dead ends: 194 [2018-07-25 13:18:31,713 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 13:18:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-25 13:18:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-07-25 13:18:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-25 13:18:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-07-25 13:18:31,717 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 192 [2018-07-25 13:18:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:31,717 INFO L472 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-07-25 13:18:31,717 INFO L473 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-07-25 13:18:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-07-25 13:18:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-07-25 13:18:31,718 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:31,718 INFO L354 BasicCegarLoop]: trace histogram [190, 1, 1, 1] [2018-07-25 13:18:31,718 INFO L415 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:31,718 INFO L82 PathProgramCache]: Analyzing trace with hash -926002079, now seen corresponding path program 190 times [2018-07-25 13:18:31,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:32,860 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:32,860 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-07-25 13:18:32,860 INFO L451 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-07-25 13:18:32,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-07-25 13:18:32,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:18:32,863 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 193 states. [2018-07-25 13:18:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:33,300 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 13:18:33,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-07-25 13:18:33,300 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 193 [2018-07-25 13:18:33,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:33,301 INFO L225 Difference]: With dead ends: 197 [2018-07-25 13:18:33,301 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 13:18:33,302 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:18:33,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 13:18:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 13:18:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 13:18:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 13:18:33,304 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 193 [2018-07-25 13:18:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:33,304 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 13:18:33,305 INFO L473 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-07-25 13:18:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 13:18:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 13:18:33,305 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:33,305 INFO L354 BasicCegarLoop]: trace histogram [191, 1, 1, 1] [2018-07-25 13:18:33,305 INFO L415 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:33,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1358704648, now seen corresponding path program 191 times [2018-07-25 13:18:33,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:34,293 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:34,294 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-07-25 13:18:34,294 INFO L451 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-07-25 13:18:34,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-07-25 13:18:34,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 13:18:34,300 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 194 states. [2018-07-25 13:18:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:34,546 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-07-25 13:18:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-07-25 13:18:34,546 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 194 [2018-07-25 13:18:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:34,547 INFO L225 Difference]: With dead ends: 198 [2018-07-25 13:18:34,547 INFO L226 Difference]: Without dead ends: 196 [2018-07-25 13:18:34,551 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 13:18:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-07-25 13:18:34,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-07-25 13:18:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-25 13:18:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-07-25 13:18:34,555 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 194 [2018-07-25 13:18:34,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:34,555 INFO L472 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-07-25 13:18:34,556 INFO L473 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-07-25 13:18:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-07-25 13:18:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-07-25 13:18:34,556 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:34,557 INFO L354 BasicCegarLoop]: trace histogram [192, 1, 1, 1] [2018-07-25 13:18:34,557 INFO L415 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:34,557 INFO L82 PathProgramCache]: Analyzing trace with hash -829830847, now seen corresponding path program 192 times [2018-07-25 13:18:34,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:35,743 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:35,743 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-07-25 13:18:35,743 INFO L451 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-07-25 13:18:35,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-07-25 13:18:35,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 13:18:35,748 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 195 states. [2018-07-25 13:18:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:36,184 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 13:18:36,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-07-25 13:18:36,184 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 195 [2018-07-25 13:18:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:36,184 INFO L225 Difference]: With dead ends: 199 [2018-07-25 13:18:36,184 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 13:18:36,187 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 13:18:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 13:18:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 13:18:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 13:18:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 13:18:36,189 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 195 [2018-07-25 13:18:36,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:36,189 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 13:18:36,189 INFO L473 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-07-25 13:18:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 13:18:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 13:18:36,190 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:36,190 INFO L354 BasicCegarLoop]: trace histogram [193, 1, 1, 1] [2018-07-25 13:18:36,190 INFO L415 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:36,190 INFO L82 PathProgramCache]: Analyzing trace with hash 45045544, now seen corresponding path program 193 times [2018-07-25 13:18:36,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:37,235 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:37,235 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-07-25 13:18:37,235 INFO L451 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-07-25 13:18:37,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-07-25 13:18:37,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 13:18:37,241 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 196 states. [2018-07-25 13:18:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:38,177 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-07-25 13:18:38,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-07-25 13:18:38,178 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 196 [2018-07-25 13:18:38,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:38,178 INFO L225 Difference]: With dead ends: 200 [2018-07-25 13:18:38,178 INFO L226 Difference]: Without dead ends: 198 [2018-07-25 13:18:38,181 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 13:18:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-07-25 13:18:38,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-07-25 13:18:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-25 13:18:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-07-25 13:18:38,183 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 196 [2018-07-25 13:18:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:38,183 INFO L472 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-07-25 13:18:38,183 INFO L473 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-07-25 13:18:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-07-25 13:18:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-07-25 13:18:38,184 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:38,184 INFO L354 BasicCegarLoop]: trace histogram [194, 1, 1, 1] [2018-07-25 13:18:38,184 INFO L415 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:38,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1396409889, now seen corresponding path program 194 times [2018-07-25 13:18:38,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:39,320 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:39,320 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-07-25 13:18:39,320 INFO L451 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-07-25 13:18:39,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-07-25 13:18:39,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 13:18:39,327 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 197 states. [2018-07-25 13:18:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:40,452 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-25 13:18:40,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-07-25 13:18:40,452 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 197 [2018-07-25 13:18:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:40,452 INFO L225 Difference]: With dead ends: 201 [2018-07-25 13:18:40,452 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:18:40,455 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 13:18:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:18:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 13:18:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 13:18:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 13:18:40,457 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 197 [2018-07-25 13:18:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:40,457 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 13:18:40,457 INFO L473 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-07-25 13:18:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 13:18:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 13:18:40,458 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:40,458 INFO L354 BasicCegarLoop]: trace histogram [195, 1, 1, 1] [2018-07-25 13:18:40,458 INFO L415 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:40,458 INFO L82 PathProgramCache]: Analyzing trace with hash 339031624, now seen corresponding path program 195 times [2018-07-25 13:18:40,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:41,532 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:41,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-07-25 13:18:41,533 INFO L451 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-07-25 13:18:41,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-07-25 13:18:41,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 13:18:41,535 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 198 states. [2018-07-25 13:18:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:42,457 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-07-25 13:18:42,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-07-25 13:18:42,457 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 198 [2018-07-25 13:18:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:42,457 INFO L225 Difference]: With dead ends: 202 [2018-07-25 13:18:42,457 INFO L226 Difference]: Without dead ends: 200 [2018-07-25 13:18:42,459 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 13:18:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-07-25 13:18:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-07-25 13:18:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-25 13:18:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-07-25 13:18:42,461 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 198 [2018-07-25 13:18:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:42,461 INFO L472 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-07-25 13:18:42,461 INFO L473 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-07-25 13:18:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-07-25 13:18:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-07-25 13:18:42,462 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:42,462 INFO L354 BasicCegarLoop]: trace histogram [196, 1, 1, 1] [2018-07-25 13:18:42,462 INFO L415 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:42,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1920043777, now seen corresponding path program 196 times [2018-07-25 13:18:42,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:43,605 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:43,606 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-07-25 13:18:43,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-07-25 13:18:43,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-07-25 13:18:43,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 13:18:43,612 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 199 states. [2018-07-25 13:18:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:44,906 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-25 13:18:44,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-07-25 13:18:44,906 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 199 [2018-07-25 13:18:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:44,907 INFO L225 Difference]: With dead ends: 203 [2018-07-25 13:18:44,907 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 13:18:44,912 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 13:18:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 13:18:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 13:18:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 13:18:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 13:18:44,916 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 199 [2018-07-25 13:18:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:44,916 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 13:18:44,916 INFO L473 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-07-25 13:18:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 13:18:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 13:18:44,917 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:44,917 INFO L354 BasicCegarLoop]: trace histogram [197, 1, 1, 1] [2018-07-25 13:18:44,917 INFO L415 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:44,918 INFO L82 PathProgramCache]: Analyzing trace with hash -608187032, now seen corresponding path program 197 times [2018-07-25 13:18:44,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:46,260 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:46,260 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:46,260 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-07-25 13:18:46,260 INFO L451 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-07-25 13:18:46,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-07-25 13:18:46,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-25 13:18:46,267 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 200 states. [2018-07-25 13:18:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:47,204 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-07-25 13:18:47,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-07-25 13:18:47,204 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 200 [2018-07-25 13:18:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:47,205 INFO L225 Difference]: With dead ends: 204 [2018-07-25 13:18:47,205 INFO L226 Difference]: Without dead ends: 202 [2018-07-25 13:18:47,207 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-25 13:18:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-07-25 13:18:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-07-25 13:18:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-07-25 13:18:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-07-25 13:18:47,210 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 200 [2018-07-25 13:18:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:47,210 INFO L472 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-07-25 13:18:47,210 INFO L473 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-07-25 13:18:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-07-25 13:18:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-07-25 13:18:47,210 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:47,211 INFO L354 BasicCegarLoop]: trace histogram [198, 1, 1, 1] [2018-07-25 13:18:47,211 INFO L415 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:47,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1673930783, now seen corresponding path program 198 times [2018-07-25 13:18:47,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:48,363 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:48,363 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-07-25 13:18:48,363 INFO L451 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-07-25 13:18:48,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-07-25 13:18:48,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 13:18:48,369 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 201 states. [2018-07-25 13:18:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:49,347 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 13:18:49,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-07-25 13:18:49,347 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 201 [2018-07-25 13:18:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:49,348 INFO L225 Difference]: With dead ends: 205 [2018-07-25 13:18:49,348 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 13:18:49,351 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 13:18:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 13:18:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 13:18:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:18:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-25 13:18:49,354 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 201 [2018-07-25 13:18:49,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:49,354 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-25 13:18:49,354 INFO L473 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-07-25 13:18:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-25 13:18:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 13:18:49,355 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:49,355 INFO L354 BasicCegarLoop]: trace histogram [199, 1, 1, 1] [2018-07-25 13:18:49,355 INFO L415 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:49,355 INFO L82 PathProgramCache]: Analyzing trace with hash -352248696, now seen corresponding path program 199 times [2018-07-25 13:18:49,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:50,612 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:50,612 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-07-25 13:18:50,612 INFO L451 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-07-25 13:18:50,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-07-25 13:18:50,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 13:18:50,619 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 202 states. [2018-07-25 13:18:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:51,549 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-07-25 13:18:51,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-07-25 13:18:51,549 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 202 [2018-07-25 13:18:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:51,550 INFO L225 Difference]: With dead ends: 206 [2018-07-25 13:18:51,550 INFO L226 Difference]: Without dead ends: 204 [2018-07-25 13:18:51,553 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 13:18:51,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-07-25 13:18:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-07-25 13:18:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-07-25 13:18:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-07-25 13:18:51,556 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 202 [2018-07-25 13:18:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:51,556 INFO L472 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-07-25 13:18:51,556 INFO L473 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-07-25 13:18:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-07-25 13:18:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-07-25 13:18:51,557 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:51,557 INFO L354 BasicCegarLoop]: trace histogram [200, 1, 1, 1] [2018-07-25 13:18:51,557 INFO L415 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:51,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1965190337, now seen corresponding path program 200 times [2018-07-25 13:18:51,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:52,764 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:52,764 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-07-25 13:18:52,764 INFO L451 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-07-25 13:18:52,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-07-25 13:18:52,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 13:18:52,767 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 203 states. [2018-07-25 13:18:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:53,434 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-25 13:18:53,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-07-25 13:18:53,434 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 203 [2018-07-25 13:18:53,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:53,434 INFO L225 Difference]: With dead ends: 207 [2018-07-25 13:18:53,434 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 13:18:53,436 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 13:18:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 13:18:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 13:18:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 13:18:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-25 13:18:53,438 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 203 [2018-07-25 13:18:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:53,438 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-25 13:18:53,439 INFO L473 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-07-25 13:18:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-25 13:18:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 13:18:53,439 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:53,439 INFO L354 BasicCegarLoop]: trace histogram [201, 1, 1, 1] [2018-07-25 13:18:53,439 INFO L415 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:53,439 INFO L82 PathProgramCache]: Analyzing trace with hash 791356328, now seen corresponding path program 201 times [2018-07-25 13:18:53,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:54,664 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:54,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-07-25 13:18:54,664 INFO L451 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-07-25 13:18:54,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-07-25 13:18:54,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-25 13:18:54,670 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 204 states. [2018-07-25 13:18:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:55,655 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-07-25 13:18:55,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-07-25 13:18:55,655 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 204 [2018-07-25 13:18:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:55,656 INFO L225 Difference]: With dead ends: 208 [2018-07-25 13:18:55,656 INFO L226 Difference]: Without dead ends: 206 [2018-07-25 13:18:55,660 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-25 13:18:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-07-25 13:18:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-07-25 13:18:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-25 13:18:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-07-25 13:18:55,662 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 204 [2018-07-25 13:18:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:55,663 INFO L472 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-07-25 13:18:55,663 INFO L473 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-07-25 13:18:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-07-25 13:18:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-07-25 13:18:55,663 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:55,663 INFO L354 BasicCegarLoop]: trace histogram [202, 1, 1, 1] [2018-07-25 13:18:55,664 INFO L415 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1237759583, now seen corresponding path program 202 times [2018-07-25 13:18:55,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20503 backedges. 0 proven. 20503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:56,954 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:56,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-07-25 13:18:56,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-07-25 13:18:56,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-07-25 13:18:56,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:18:56,961 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 205 states. [2018-07-25 13:18:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:58,068 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-25 13:18:58,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-07-25 13:18:58,069 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 205 [2018-07-25 13:18:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:58,069 INFO L225 Difference]: With dead ends: 209 [2018-07-25 13:18:58,069 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 13:18:58,073 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:18:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 13:18:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 13:18:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 13:18:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-25 13:18:58,075 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 205 [2018-07-25 13:18:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:58,076 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-25 13:18:58,076 INFO L473 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-07-25 13:18:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-25 13:18:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 13:18:58,076 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:58,076 INFO L354 BasicCegarLoop]: trace histogram [203, 1, 1, 1] [2018-07-25 13:18:58,076 INFO L415 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:58,077 INFO L82 PathProgramCache]: Analyzing trace with hash 284156616, now seen corresponding path program 203 times [2018-07-25 13:18:58,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:59,379 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:59,379 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-07-25 13:18:59,379 INFO L451 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-07-25 13:18:59,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-07-25 13:18:59,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-25 13:18:59,386 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 206 states. [2018-07-25 13:19:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:00,590 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-07-25 13:19:00,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-07-25 13:19:00,590 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 206 [2018-07-25 13:19:00,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:00,591 INFO L225 Difference]: With dead ends: 210 [2018-07-25 13:19:00,591 INFO L226 Difference]: Without dead ends: 208 [2018-07-25 13:19:00,593 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-25 13:19:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-07-25 13:19:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-07-25 13:19:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-07-25 13:19:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-07-25 13:19:00,597 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 206 [2018-07-25 13:19:00,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:00,597 INFO L472 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-07-25 13:19:00,597 INFO L473 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-07-25 13:19:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-07-25 13:19:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-07-25 13:19:00,598 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:00,598 INFO L354 BasicCegarLoop]: trace histogram [204, 1, 1, 1] [2018-07-25 13:19:00,598 INFO L415 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:00,598 INFO L82 PathProgramCache]: Analyzing trace with hash 218918529, now seen corresponding path program 204 times [2018-07-25 13:19:00,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 20910 backedges. 0 proven. 20910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:01,946 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:01,946 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206] total 206 [2018-07-25 13:19:01,946 INFO L451 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-07-25 13:19:01,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-07-25 13:19:01,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-07-25 13:19:01,953 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 207 states. [2018-07-25 13:19:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:03,495 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-25 13:19:03,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-07-25 13:19:03,495 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 207 [2018-07-25 13:19:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:03,495 INFO L225 Difference]: With dead ends: 211 [2018-07-25 13:19:03,495 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 13:19:03,499 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-07-25 13:19:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 13:19:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-25 13:19:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-25 13:19:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-25 13:19:03,502 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 207 [2018-07-25 13:19:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:03,503 INFO L472 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-25 13:19:03,503 INFO L473 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-07-25 13:19:03,503 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-25 13:19:03,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-25 13:19:03,503 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:03,503 INFO L354 BasicCegarLoop]: trace histogram [205, 1, 1, 1] [2018-07-25 13:19:03,504 INFO L415 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:03,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1803462168, now seen corresponding path program 205 times [2018-07-25 13:19:03,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:04,835 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:04,835 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-07-25 13:19:04,835 INFO L451 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-07-25 13:19:04,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-07-25 13:19:04,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-07-25 13:19:04,841 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 208 states. [2018-07-25 13:19:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:06,119 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-07-25 13:19:06,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-07-25 13:19:06,119 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 208 [2018-07-25 13:19:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:06,119 INFO L225 Difference]: With dead ends: 212 [2018-07-25 13:19:06,120 INFO L226 Difference]: Without dead ends: 210 [2018-07-25 13:19:06,122 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-07-25 13:19:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-07-25 13:19:06,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-07-25 13:19:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-07-25 13:19:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-07-25 13:19:06,126 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 208 [2018-07-25 13:19:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:06,126 INFO L472 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-07-25 13:19:06,126 INFO L473 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-07-25 13:19:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-07-25 13:19:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-07-25 13:19:06,127 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:06,127 INFO L354 BasicCegarLoop]: trace histogram [206, 1, 1, 1] [2018-07-25 13:19:06,127 INFO L415 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:06,127 INFO L82 PathProgramCache]: Analyzing trace with hash -72754335, now seen corresponding path program 206 times [2018-07-25 13:19:06,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 21321 backedges. 0 proven. 21321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:07,748 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:07,748 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208] total 208 [2018-07-25 13:19:07,749 INFO L451 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-07-25 13:19:07,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-07-25 13:19:07,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-07-25 13:19:07,755 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 209 states. [2018-07-25 13:19:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:09,258 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-25 13:19:09,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-07-25 13:19:09,259 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 209 [2018-07-25 13:19:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:09,259 INFO L225 Difference]: With dead ends: 213 [2018-07-25 13:19:09,259 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 13:19:09,263 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-07-25 13:19:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 13:19:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-25 13:19:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 13:19:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-25 13:19:09,266 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 209 [2018-07-25 13:19:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:09,266 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-25 13:19:09,266 INFO L473 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-07-25 13:19:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-25 13:19:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 13:19:09,267 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:09,267 INFO L354 BasicCegarLoop]: trace histogram [207, 1, 1, 1] [2018-07-25 13:19:09,267 INFO L415 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:09,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2039580936, now seen corresponding path program 207 times [2018-07-25 13:19:09,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:10,610 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:10,610 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-07-25 13:19:10,611 INFO L451 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-07-25 13:19:10,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-07-25 13:19:10,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-07-25 13:19:10,616 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 210 states. [2018-07-25 13:19:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:11,796 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-07-25 13:19:11,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-07-25 13:19:11,796 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 210 [2018-07-25 13:19:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:11,797 INFO L225 Difference]: With dead ends: 214 [2018-07-25 13:19:11,797 INFO L226 Difference]: Without dead ends: 212 [2018-07-25 13:19:11,799 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-07-25 13:19:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-07-25 13:19:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-07-25 13:19:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-07-25 13:19:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-07-25 13:19:11,802 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 210 [2018-07-25 13:19:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:11,802 INFO L472 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-07-25 13:19:11,802 INFO L473 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-07-25 13:19:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-07-25 13:19:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-07-25 13:19:11,803 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:11,803 INFO L354 BasicCegarLoop]: trace histogram [208, 1, 1, 1] [2018-07-25 13:19:11,803 INFO L415 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:11,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1197502399, now seen corresponding path program 208 times [2018-07-25 13:19:11,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 21736 backedges. 0 proven. 21736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:13,185 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:13,186 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210] total 210 [2018-07-25 13:19:13,186 INFO L451 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-07-25 13:19:13,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-07-25 13:19:13,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-07-25 13:19:13,192 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 211 states. [2018-07-25 13:19:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:14,041 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-25 13:19:14,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-07-25 13:19:14,041 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 211 [2018-07-25 13:19:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:14,041 INFO L225 Difference]: With dead ends: 215 [2018-07-25 13:19:14,041 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 13:19:14,045 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-07-25 13:19:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 13:19:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-25 13:19:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-25 13:19:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-25 13:19:14,048 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 211 [2018-07-25 13:19:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:14,048 INFO L472 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-25 13:19:14,048 INFO L473 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-07-25 13:19:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-25 13:19:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-25 13:19:14,049 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:14,049 INFO L354 BasicCegarLoop]: trace histogram [209, 1, 1, 1] [2018-07-25 13:19:14,049 INFO L415 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1532129320, now seen corresponding path program 209 times [2018-07-25 13:19:14,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:15,366 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:15,366 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-07-25 13:19:15,366 INFO L451 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-07-25 13:19:15,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-07-25 13:19:15,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-07-25 13:19:15,369 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 212 states. [2018-07-25 13:19:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:15,977 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-07-25 13:19:15,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-07-25 13:19:15,977 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 212 [2018-07-25 13:19:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:15,977 INFO L225 Difference]: With dead ends: 216 [2018-07-25 13:19:15,978 INFO L226 Difference]: Without dead ends: 214 [2018-07-25 13:19:15,979 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-07-25 13:19:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-07-25 13:19:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-07-25 13:19:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-07-25 13:19:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-07-25 13:19:15,982 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 212 [2018-07-25 13:19:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:15,982 INFO L472 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-07-25 13:19:15,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-07-25 13:19:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-07-25 13:19:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-07-25 13:19:15,983 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:15,983 INFO L354 BasicCegarLoop]: trace histogram [210, 1, 1, 1] [2018-07-25 13:19:15,983 INFO L415 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:15,983 INFO L82 PathProgramCache]: Analyzing trace with hash 251366689, now seen corresponding path program 210 times [2018-07-25 13:19:15,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 22155 backedges. 0 proven. 22155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:17,305 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:17,305 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212] total 212 [2018-07-25 13:19:17,306 INFO L451 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-07-25 13:19:17,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-07-25 13:19:17,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-07-25 13:19:17,312 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 213 states. [2018-07-25 13:19:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:18,405 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-25 13:19:18,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-07-25 13:19:18,405 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 213 [2018-07-25 13:19:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:18,406 INFO L225 Difference]: With dead ends: 217 [2018-07-25 13:19:18,406 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 13:19:18,408 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-07-25 13:19:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 13:19:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-25 13:19:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-25 13:19:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-25 13:19:18,411 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 213 [2018-07-25 13:19:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:18,411 INFO L472 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-25 13:19:18,411 INFO L473 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-07-25 13:19:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-25 13:19:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-25 13:19:18,412 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:18,412 INFO L354 BasicCegarLoop]: trace histogram [211, 1, 1, 1] [2018-07-25 13:19:18,412 INFO L415 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash -797569208, now seen corresponding path program 211 times [2018-07-25 13:19:18,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:19,839 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:19,839 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-07-25 13:19:19,839 INFO L451 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-07-25 13:19:19,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-07-25 13:19:19,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-07-25 13:19:19,843 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 214 states. [2018-07-25 13:19:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:21,418 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-07-25 13:19:21,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-07-25 13:19:21,418 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 214 [2018-07-25 13:19:21,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:21,419 INFO L225 Difference]: With dead ends: 218 [2018-07-25 13:19:21,419 INFO L226 Difference]: Without dead ends: 216 [2018-07-25 13:19:21,420 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-07-25 13:19:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-07-25 13:19:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-07-25 13:19:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-07-25 13:19:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-07-25 13:19:21,423 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 214 [2018-07-25 13:19:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:21,424 INFO L472 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-07-25 13:19:21,424 INFO L473 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-07-25 13:19:21,424 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-07-25 13:19:21,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-07-25 13:19:21,424 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:21,424 INFO L354 BasicCegarLoop]: trace histogram [212, 1, 1, 1] [2018-07-25 13:19:21,424 INFO L415 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:21,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1045156353, now seen corresponding path program 212 times [2018-07-25 13:19:21,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 22578 backedges. 0 proven. 22578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:22,862 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:22,862 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214] total 214 [2018-07-25 13:19:22,862 INFO L451 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-07-25 13:19:22,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-07-25 13:19:22,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-07-25 13:19:22,869 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 215 states. [2018-07-25 13:19:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:23,829 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-25 13:19:23,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-07-25 13:19:23,829 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 215 [2018-07-25 13:19:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:23,830 INFO L225 Difference]: With dead ends: 219 [2018-07-25 13:19:23,830 INFO L226 Difference]: Without dead ends: 217 [2018-07-25 13:19:23,833 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-07-25 13:19:23,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-25 13:19:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-25 13:19:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-25 13:19:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-25 13:19:23,835 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 215 [2018-07-25 13:19:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:23,835 INFO L472 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-25 13:19:23,835 INFO L473 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-07-25 13:19:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-25 13:19:23,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-25 13:19:23,836 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:23,836 INFO L354 BasicCegarLoop]: trace histogram [213, 1, 1, 1] [2018-07-25 13:19:23,836 INFO L415 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1959893400, now seen corresponding path program 213 times [2018-07-25 13:19:23,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:25,158 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:25,158 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-07-25 13:19:25,158 INFO L451 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-07-25 13:19:25,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-07-25 13:19:25,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-07-25 13:19:25,161 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 216 states. [2018-07-25 13:19:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:25,578 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-07-25 13:19:25,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-07-25 13:19:25,578 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 216 [2018-07-25 13:19:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:25,578 INFO L225 Difference]: With dead ends: 220 [2018-07-25 13:19:25,579 INFO L226 Difference]: Without dead ends: 218 [2018-07-25 13:19:25,580 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-07-25 13:19:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-25 13:19:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-07-25 13:19:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-07-25 13:19:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-07-25 13:19:25,582 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 216 [2018-07-25 13:19:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:25,582 INFO L472 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-07-25 13:19:25,582 INFO L473 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-07-25 13:19:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-07-25 13:19:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-07-25 13:19:25,583 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:25,583 INFO L354 BasicCegarLoop]: trace histogram [214, 1, 1, 1] [2018-07-25 13:19:25,583 INFO L415 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:25,583 INFO L82 PathProgramCache]: Analyzing trace with hash -627155231, now seen corresponding path program 214 times [2018-07-25 13:19:25,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 23005 backedges. 0 proven. 23005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:26,896 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:26,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216] total 216 [2018-07-25 13:19:26,896 INFO L451 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-07-25 13:19:26,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-07-25 13:19:26,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-07-25 13:19:26,902 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 217 states. [2018-07-25 13:19:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:27,649 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-07-25 13:19:27,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-07-25 13:19:27,649 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 217 [2018-07-25 13:19:27,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:27,649 INFO L225 Difference]: With dead ends: 221 [2018-07-25 13:19:27,650 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 13:19:27,652 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-07-25 13:19:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 13:19:27,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-25 13:19:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-25 13:19:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-07-25 13:19:27,655 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 217 [2018-07-25 13:19:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:27,655 INFO L472 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-07-25 13:19:27,655 INFO L473 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-07-25 13:19:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-07-25 13:19:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-25 13:19:27,656 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:27,656 INFO L354 BasicCegarLoop]: trace histogram [215, 1, 1, 1] [2018-07-25 13:19:27,656 INFO L415 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:27,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2033022344, now seen corresponding path program 215 times [2018-07-25 13:19:27,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:28,987 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:28,987 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-07-25 13:19:28,987 INFO L451 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-07-25 13:19:28,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-07-25 13:19:28,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-07-25 13:19:28,993 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 218 states. [2018-07-25 13:19:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:30,416 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-07-25 13:19:30,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-07-25 13:19:30,416 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 218 [2018-07-25 13:19:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:30,417 INFO L225 Difference]: With dead ends: 222 [2018-07-25 13:19:30,417 INFO L226 Difference]: Without dead ends: 220 [2018-07-25 13:19:30,418 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-07-25 13:19:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-07-25 13:19:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-07-25 13:19:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-07-25 13:19:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-07-25 13:19:30,420 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 218 [2018-07-25 13:19:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:30,421 INFO L472 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-07-25 13:19:30,421 INFO L473 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-07-25 13:19:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-07-25 13:19:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-07-25 13:19:30,421 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:30,421 INFO L354 BasicCegarLoop]: trace histogram [216, 1, 1, 1] [2018-07-25 13:19:30,422 INFO L415 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:30,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1400818751, now seen corresponding path program 216 times [2018-07-25 13:19:30,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 23436 backedges. 0 proven. 23436 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:31,812 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:31,812 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218] total 218 [2018-07-25 13:19:31,812 INFO L451 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-07-25 13:19:31,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-07-25 13:19:31,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-07-25 13:19:31,820 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 219 states. [2018-07-25 13:19:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:33,192 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-25 13:19:33,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-07-25 13:19:33,193 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 219 [2018-07-25 13:19:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:33,193 INFO L225 Difference]: With dead ends: 223 [2018-07-25 13:19:33,193 INFO L226 Difference]: Without dead ends: 221 [2018-07-25 13:19:33,199 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-07-25 13:19:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-25 13:19:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-25 13:19:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 13:19:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-25 13:19:33,203 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 219 [2018-07-25 13:19:33,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:33,203 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-25 13:19:33,203 INFO L473 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-07-25 13:19:33,203 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-25 13:19:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-25 13:19:33,204 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:33,204 INFO L354 BasicCegarLoop]: trace histogram [217, 1, 1, 1] [2018-07-25 13:19:33,204 INFO L415 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:33,205 INFO L82 PathProgramCache]: Analyzing trace with hash -475710296, now seen corresponding path program 217 times [2018-07-25 13:19:33,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:34,885 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:34,885 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219] total 219 [2018-07-25 13:19:34,885 INFO L451 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-07-25 13:19:34,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-07-25 13:19:34,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-07-25 13:19:34,894 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 220 states. [2018-07-25 13:19:35,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:35,844 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-07-25 13:19:35,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-07-25 13:19:35,844 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 220 [2018-07-25 13:19:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:35,844 INFO L225 Difference]: With dead ends: 224 [2018-07-25 13:19:35,845 INFO L226 Difference]: Without dead ends: 222 [2018-07-25 13:19:35,846 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-07-25 13:19:35,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-07-25 13:19:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-07-25 13:19:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-07-25 13:19:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-07-25 13:19:35,850 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 220 [2018-07-25 13:19:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:35,850 INFO L472 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-07-25 13:19:35,850 INFO L473 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-07-25 13:19:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-07-25 13:19:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-07-25 13:19:35,851 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:35,852 INFO L354 BasicCegarLoop]: trace histogram [218, 1, 1, 1] [2018-07-25 13:19:35,852 INFO L415 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1862119263, now seen corresponding path program 218 times [2018-07-25 13:19:35,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 23871 backedges. 0 proven. 23871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:37,516 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:37,516 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [220] total 220 [2018-07-25 13:19:37,516 INFO L451 AbstractCegarLoop]: Interpolant automaton has 221 states [2018-07-25 13:19:37,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2018-07-25 13:19:37,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-07-25 13:19:37,523 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 221 states. [2018-07-25 13:19:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:39,065 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-25 13:19:39,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-07-25 13:19:39,065 INFO L78 Accepts]: Start accepts. Automaton has 221 states. Word has length 221 [2018-07-25 13:19:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:39,065 INFO L225 Difference]: With dead ends: 225 [2018-07-25 13:19:39,066 INFO L226 Difference]: Without dead ends: 223 [2018-07-25 13:19:39,068 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-07-25 13:19:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-25 13:19:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-25 13:19:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-25 13:19:39,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-07-25 13:19:39,071 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 221 [2018-07-25 13:19:39,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:39,071 INFO L472 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-07-25 13:19:39,071 INFO L473 AbstractCegarLoop]: Interpolant automaton has 221 states. [2018-07-25 13:19:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-07-25 13:19:39,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-25 13:19:39,072 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:39,072 INFO L354 BasicCegarLoop]: trace histogram [219, 1, 1, 1] [2018-07-25 13:19:39,072 INFO L415 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:39,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1891124280, now seen corresponding path program 219 times [2018-07-25 13:19:39,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:40,641 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:40,641 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [221] total 221 [2018-07-25 13:19:40,642 INFO L451 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-07-25 13:19:40,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-07-25 13:19:40,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-07-25 13:19:40,645 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 222 states. [2018-07-25 13:19:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:41,184 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-07-25 13:19:41,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-07-25 13:19:41,184 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 222 [2018-07-25 13:19:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:41,185 INFO L225 Difference]: With dead ends: 226 [2018-07-25 13:19:41,185 INFO L226 Difference]: Without dead ends: 224 [2018-07-25 13:19:41,186 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-07-25 13:19:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-07-25 13:19:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-07-25 13:19:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-07-25 13:19:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-07-25 13:19:41,189 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 222 [2018-07-25 13:19:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:41,189 INFO L472 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-07-25 13:19:41,189 INFO L473 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-07-25 13:19:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-07-25 13:19:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-07-25 13:19:41,190 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:41,190 INFO L354 BasicCegarLoop]: trace histogram [220, 1, 1, 1] [2018-07-25 13:19:41,190 INFO L415 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:41,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1504687489, now seen corresponding path program 220 times [2018-07-25 13:19:41,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24310 backedges. 0 proven. 24310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:42,758 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:42,758 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [222] total 222 [2018-07-25 13:19:42,759 INFO L451 AbstractCegarLoop]: Interpolant automaton has 223 states [2018-07-25 13:19:42,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 223 interpolants. [2018-07-25 13:19:42,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24753, Invalid=24753, Unknown=0, NotChecked=0, Total=49506 [2018-07-25 13:19:42,768 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 223 states. [2018-07-25 13:19:43,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:43,905 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-25 13:19:43,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2018-07-25 13:19:43,905 INFO L78 Accepts]: Start accepts. Automaton has 223 states. Word has length 223 [2018-07-25 13:19:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:43,905 INFO L225 Difference]: With dead ends: 227 [2018-07-25 13:19:43,906 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 13:19:43,910 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24753, Invalid=24753, Unknown=0, NotChecked=0, Total=49506 [2018-07-25 13:19:43,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 13:19:43,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-25 13:19:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 13:19:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-25 13:19:43,913 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 223 [2018-07-25 13:19:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:43,913 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-25 13:19:43,913 INFO L473 AbstractCegarLoop]: Interpolant automaton has 223 states. [2018-07-25 13:19:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-25 13:19:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-25 13:19:43,914 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:43,914 INFO L354 BasicCegarLoop]: trace histogram [221, 1, 1, 1] [2018-07-25 13:19:43,914 INFO L415 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:43,914 INFO L82 PathProgramCache]: Analyzing trace with hash -599330072, now seen corresponding path program 221 times [2018-07-25 13:19:43,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 24531 backedges. 0 proven. 24531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:45,659 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:45,659 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [223] total 223 [2018-07-25 13:19:45,660 INFO L451 AbstractCegarLoop]: Interpolant automaton has 224 states [2018-07-25 13:19:45,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 224 interpolants. [2018-07-25 13:19:45,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-07-25 13:19:45,663 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 224 states. [2018-07-25 13:19:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:47,412 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-07-25 13:19:47,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-07-25 13:19:47,413 INFO L78 Accepts]: Start accepts. Automaton has 224 states. Word has length 224 [2018-07-25 13:19:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:47,413 INFO L225 Difference]: With dead ends: 228 [2018-07-25 13:19:47,413 INFO L226 Difference]: Without dead ends: 226 [2018-07-25 13:19:47,415 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-07-25 13:19:47,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-07-25 13:19:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-07-25 13:19:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-07-25 13:19:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-07-25 13:19:47,418 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 224 [2018-07-25 13:19:47,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:47,418 INFO L472 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-07-25 13:19:47,418 INFO L473 AbstractCegarLoop]: Interpolant automaton has 224 states. [2018-07-25 13:19:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-07-25 13:19:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-07-25 13:19:47,419 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:47,419 INFO L354 BasicCegarLoop]: trace histogram [222, 1, 1, 1] [2018-07-25 13:19:47,419 INFO L415 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:47,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1399365023, now seen corresponding path program 222 times [2018-07-25 13:19:47,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 24753 backedges. 0 proven. 24753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:49,071 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:49,071 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [224] total 224 [2018-07-25 13:19:49,071 INFO L451 AbstractCegarLoop]: Interpolant automaton has 225 states [2018-07-25 13:19:49,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 225 interpolants. [2018-07-25 13:19:49,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2018-07-25 13:19:49,079 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 225 states. [2018-07-25 13:19:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:50,085 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-07-25 13:19:50,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-07-25 13:19:50,085 INFO L78 Accepts]: Start accepts. Automaton has 225 states. Word has length 225 [2018-07-25 13:19:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:50,086 INFO L225 Difference]: With dead ends: 229 [2018-07-25 13:19:50,086 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 13:19:50,091 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2018-07-25 13:19:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 13:19:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-25 13:19:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 13:19:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-25 13:19:50,094 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 225 [2018-07-25 13:19:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:50,094 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-25 13:19:50,094 INFO L473 AbstractCegarLoop]: Interpolant automaton has 225 states. [2018-07-25 13:19:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-25 13:19:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-25 13:19:50,095 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:50,095 INFO L354 BasicCegarLoop]: trace histogram [223, 1, 1, 1] [2018-07-25 13:19:50,095 INFO L415 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:50,095 INFO L82 PathProgramCache]: Analyzing trace with hash -430644728, now seen corresponding path program 223 times [2018-07-25 13:19:50,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 24976 backedges. 0 proven. 24976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:51,858 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:51,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [225] total 225 [2018-07-25 13:19:51,858 INFO L451 AbstractCegarLoop]: Interpolant automaton has 226 states [2018-07-25 13:19:51,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 226 interpolants. [2018-07-25 13:19:51,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-07-25 13:19:51,863 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 226 states. [2018-07-25 13:19:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:53,910 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-07-25 13:19:53,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2018-07-25 13:19:53,910 INFO L78 Accepts]: Start accepts. Automaton has 226 states. Word has length 226 [2018-07-25 13:19:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:53,911 INFO L225 Difference]: With dead ends: 230 [2018-07-25 13:19:53,911 INFO L226 Difference]: Without dead ends: 228 [2018-07-25 13:19:53,913 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-07-25 13:19:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-07-25 13:19:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-07-25 13:19:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-07-25 13:19:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-07-25 13:19:53,916 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 226 [2018-07-25 13:19:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:53,916 INFO L472 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-07-25 13:19:53,916 INFO L473 AbstractCegarLoop]: Interpolant automaton has 226 states. [2018-07-25 13:19:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-07-25 13:19:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-07-25 13:19:53,917 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:53,917 INFO L354 BasicCegarLoop]: trace histogram [224, 1, 1, 1] [2018-07-25 13:19:53,917 INFO L415 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:53,918 INFO L82 PathProgramCache]: Analyzing trace with hash -465086655, now seen corresponding path program 224 times [2018-07-25 13:19:53,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 25200 backedges. 0 proven. 25200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:55,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:55,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [226] total 226 [2018-07-25 13:19:55,690 INFO L451 AbstractCegarLoop]: Interpolant automaton has 227 states [2018-07-25 13:19:55,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 227 interpolants. [2018-07-25 13:19:55,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25651, Invalid=25651, Unknown=0, NotChecked=0, Total=51302 [2018-07-25 13:19:55,699 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 227 states. [2018-07-25 13:19:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:56,292 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-25 13:19:56,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-07-25 13:19:56,292 INFO L78 Accepts]: Start accepts. Automaton has 227 states. Word has length 227 [2018-07-25 13:19:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:56,293 INFO L225 Difference]: With dead ends: 231 [2018-07-25 13:19:56,293 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 13:19:56,298 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=25651, Invalid=25651, Unknown=0, NotChecked=0, Total=51302 [2018-07-25 13:19:56,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 13:19:56,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-25 13:19:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-25 13:19:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-25 13:19:56,301 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 227 [2018-07-25 13:19:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:56,301 INFO L472 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-25 13:19:56,301 INFO L473 AbstractCegarLoop]: Interpolant automaton has 227 states. [2018-07-25 13:19:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-25 13:19:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-25 13:19:56,302 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:56,302 INFO L354 BasicCegarLoop]: trace histogram [225, 1, 1, 1] [2018-07-25 13:19:56,302 INFO L415 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:56,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1532786392, now seen corresponding path program 225 times [2018-07-25 13:19:56,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 25425 backedges. 0 proven. 25425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:58,069 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:58,069 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [227] total 227 [2018-07-25 13:19:58,069 INFO L451 AbstractCegarLoop]: Interpolant automaton has 228 states [2018-07-25 13:19:58,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 228 interpolants. [2018-07-25 13:19:58,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-07-25 13:19:58,075 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 228 states. [2018-07-25 13:20:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:00,123 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-07-25 13:20:00,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2018-07-25 13:20:00,123 INFO L78 Accepts]: Start accepts. Automaton has 228 states. Word has length 228 [2018-07-25 13:20:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:00,124 INFO L225 Difference]: With dead ends: 232 [2018-07-25 13:20:00,124 INFO L226 Difference]: Without dead ends: 230 [2018-07-25 13:20:00,127 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-07-25 13:20:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-07-25 13:20:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-07-25 13:20:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-07-25 13:20:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-07-25 13:20:00,130 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 228 [2018-07-25 13:20:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:00,130 INFO L472 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-07-25 13:20:00,130 INFO L473 AbstractCegarLoop]: Interpolant automaton has 228 states. [2018-07-25 13:20:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-07-25 13:20:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-07-25 13:20:00,131 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:00,131 INFO L354 BasicCegarLoop]: trace histogram [226, 1, 1, 1] [2018-07-25 13:20:00,131 INFO L415 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:00,131 INFO L82 PathProgramCache]: Analyzing trace with hash -271739871, now seen corresponding path program 226 times [2018-07-25 13:20:00,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 25651 backedges. 0 proven. 25651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:01,867 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:01,868 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [228] total 228 [2018-07-25 13:20:01,868 INFO L451 AbstractCegarLoop]: Interpolant automaton has 229 states [2018-07-25 13:20:01,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 229 interpolants. [2018-07-25 13:20:01,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26106, Invalid=26106, Unknown=0, NotChecked=0, Total=52212 [2018-07-25 13:20:01,877 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 229 states. [2018-07-25 13:20:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:03,258 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-07-25 13:20:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-07-25 13:20:03,258 INFO L78 Accepts]: Start accepts. Automaton has 229 states. Word has length 229 [2018-07-25 13:20:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:03,259 INFO L225 Difference]: With dead ends: 233 [2018-07-25 13:20:03,259 INFO L226 Difference]: Without dead ends: 231 [2018-07-25 13:20:03,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=26106, Invalid=26106, Unknown=0, NotChecked=0, Total=52212 [2018-07-25 13:20:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-25 13:20:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-25 13:20:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 13:20:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-25 13:20:03,267 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 229 [2018-07-25 13:20:03,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:03,267 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-25 13:20:03,267 INFO L473 AbstractCegarLoop]: Interpolant automaton has 229 states. [2018-07-25 13:20:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-25 13:20:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-25 13:20:03,268 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:03,268 INFO L354 BasicCegarLoop]: trace histogram [227, 1, 1, 1] [2018-07-25 13:20:03,268 INFO L415 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:03,268 INFO L82 PathProgramCache]: Analyzing trace with hash 165996616, now seen corresponding path program 227 times [2018-07-25 13:20:03,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 25878 backedges. 0 proven. 25878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:05,020 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:05,020 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [229] total 229 [2018-07-25 13:20:05,020 INFO L451 AbstractCegarLoop]: Interpolant automaton has 230 states [2018-07-25 13:20:05,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2018-07-25 13:20:05,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-07-25 13:20:05,029 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 230 states. [2018-07-25 13:20:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,076 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-07-25 13:20:07,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2018-07-25 13:20:07,076 INFO L78 Accepts]: Start accepts. Automaton has 230 states. Word has length 230 [2018-07-25 13:20:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,077 INFO L225 Difference]: With dead ends: 234 [2018-07-25 13:20:07,077 INFO L226 Difference]: Without dead ends: 232 [2018-07-25 13:20:07,082 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-07-25 13:20:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-07-25 13:20:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-07-25 13:20:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-07-25 13:20:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-07-25 13:20:07,085 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 230 [2018-07-25 13:20:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,085 INFO L472 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-07-25 13:20:07,085 INFO L473 AbstractCegarLoop]: Interpolant automaton has 230 states. [2018-07-25 13:20:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-07-25 13:20:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-07-25 13:20:07,085 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,086 INFO L354 BasicCegarLoop]: trace histogram [228, 1, 1, 1] [2018-07-25 13:20:07,086 INFO L415 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,086 INFO L82 PathProgramCache]: Analyzing trace with hash 850925825, now seen corresponding path program 228 times [2018-07-25 13:20:07,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 26106 backedges. 0 proven. 26106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:08,680 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:08,680 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [230] total 230 [2018-07-25 13:20:08,680 INFO L451 AbstractCegarLoop]: Interpolant automaton has 231 states [2018-07-25 13:20:08,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 231 interpolants. [2018-07-25 13:20:08,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26565, Invalid=26565, Unknown=0, NotChecked=0, Total=53130 [2018-07-25 13:20:08,687 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 231 states. [2018-07-25 13:20:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:09,161 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-25 13:20:09,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2018-07-25 13:20:09,161 INFO L78 Accepts]: Start accepts. Automaton has 231 states. Word has length 231 [2018-07-25 13:20:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:09,161 INFO L225 Difference]: With dead ends: 235 [2018-07-25 13:20:09,161 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 13:20:09,164 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=26565, Invalid=26565, Unknown=0, NotChecked=0, Total=53130 [2018-07-25 13:20:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 13:20:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-25 13:20:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 13:20:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-25 13:20:09,167 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 231 [2018-07-25 13:20:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:09,167 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-25 13:20:09,167 INFO L473 AbstractCegarLoop]: Interpolant automaton has 231 states. [2018-07-25 13:20:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-25 13:20:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-25 13:20:09,168 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:09,168 INFO L354 BasicCegarLoop]: trace histogram [229, 1, 1, 1] [2018-07-25 13:20:09,168 INFO L415 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:09,168 INFO L82 PathProgramCache]: Analyzing trace with hash 608894824, now seen corresponding path program 229 times [2018-07-25 13:20:09,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 26335 backedges. 0 proven. 26335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:10,773 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:10,773 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [231] total 231 [2018-07-25 13:20:10,774 INFO L451 AbstractCegarLoop]: Interpolant automaton has 232 states [2018-07-25 13:20:10,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 232 interpolants. [2018-07-25 13:20:10,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26796, Invalid=26796, Unknown=0, NotChecked=0, Total=53592 [2018-07-25 13:20:10,783 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 232 states. [2018-07-25 13:20:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:13,139 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-07-25 13:20:13,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-07-25 13:20:13,139 INFO L78 Accepts]: Start accepts. Automaton has 232 states. Word has length 232 [2018-07-25 13:20:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:13,140 INFO L225 Difference]: With dead ends: 236 [2018-07-25 13:20:13,140 INFO L226 Difference]: Without dead ends: 234 [2018-07-25 13:20:13,146 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=26796, Invalid=26796, Unknown=0, NotChecked=0, Total=53592 [2018-07-25 13:20:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-07-25 13:20:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-07-25 13:20:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-07-25 13:20:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-07-25 13:20:13,149 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 232 [2018-07-25 13:20:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:13,149 INFO L472 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-07-25 13:20:13,149 INFO L473 AbstractCegarLoop]: Interpolant automaton has 232 states. [2018-07-25 13:20:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-07-25 13:20:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-07-25 13:20:13,150 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:13,150 INFO L354 BasicCegarLoop]: trace histogram [230, 1, 1, 1] [2018-07-25 13:20:13,150 INFO L415 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:13,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1695868385, now seen corresponding path program 230 times [2018-07-25 13:20:13,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 26565 backedges. 0 proven. 26565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:14,877 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:14,877 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [232] total 232 [2018-07-25 13:20:14,878 INFO L451 AbstractCegarLoop]: Interpolant automaton has 233 states [2018-07-25 13:20:14,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 233 interpolants. [2018-07-25 13:20:14,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27028, Invalid=27028, Unknown=0, NotChecked=0, Total=54056 [2018-07-25 13:20:14,885 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 233 states. [2018-07-25 13:20:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:16,332 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-25 13:20:16,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2018-07-25 13:20:16,332 INFO L78 Accepts]: Start accepts. Automaton has 233 states. Word has length 233 [2018-07-25 13:20:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:16,333 INFO L225 Difference]: With dead ends: 237 [2018-07-25 13:20:16,333 INFO L226 Difference]: Without dead ends: 235 [2018-07-25 13:20:16,336 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=27028, Invalid=27028, Unknown=0, NotChecked=0, Total=54056 [2018-07-25 13:20:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-25 13:20:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-25 13:20:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-25 13:20:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-07-25 13:20:16,340 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 233 [2018-07-25 13:20:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:16,340 INFO L472 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-07-25 13:20:16,340 INFO L473 AbstractCegarLoop]: Interpolant automaton has 233 states. [2018-07-25 13:20:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-07-25 13:20:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-25 13:20:16,341 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:16,341 INFO L354 BasicCegarLoop]: trace histogram [231, 1, 1, 1] [2018-07-25 13:20:16,341 INFO L415 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:16,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1032310408, now seen corresponding path program 231 times [2018-07-25 13:20:16,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 26796 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:18,194 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:18,195 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [233] total 233 [2018-07-25 13:20:18,195 INFO L451 AbstractCegarLoop]: Interpolant automaton has 234 states [2018-07-25 13:20:18,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 234 interpolants. [2018-07-25 13:20:18,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27261, Invalid=27261, Unknown=0, NotChecked=0, Total=54522 [2018-07-25 13:20:18,203 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 234 states. [2018-07-25 13:20:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:19,414 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-07-25 13:20:19,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-07-25 13:20:19,414 INFO L78 Accepts]: Start accepts. Automaton has 234 states. Word has length 234 [2018-07-25 13:20:19,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:19,415 INFO L225 Difference]: With dead ends: 238 [2018-07-25 13:20:19,415 INFO L226 Difference]: Without dead ends: 236 [2018-07-25 13:20:19,421 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=27261, Invalid=27261, Unknown=0, NotChecked=0, Total=54522 [2018-07-25 13:20:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-07-25 13:20:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-07-25 13:20:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-25 13:20:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-07-25 13:20:19,424 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 234 [2018-07-25 13:20:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:19,424 INFO L472 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-07-25 13:20:19,424 INFO L473 AbstractCegarLoop]: Interpolant automaton has 234 states. [2018-07-25 13:20:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-07-25 13:20:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-07-25 13:20:19,425 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:19,425 INFO L354 BasicCegarLoop]: trace histogram [232, 1, 1, 1] [2018-07-25 13:20:19,425 INFO L415 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:19,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1936849601, now seen corresponding path program 232 times [2018-07-25 13:20:19,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 27028 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:21,210 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:21,210 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [234] total 234 [2018-07-25 13:20:21,210 INFO L451 AbstractCegarLoop]: Interpolant automaton has 235 states [2018-07-25 13:20:21,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 235 interpolants. [2018-07-25 13:20:21,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27495, Invalid=27495, Unknown=0, NotChecked=0, Total=54990 [2018-07-25 13:20:21,219 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 235 states. [2018-07-25 13:20:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:23,183 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-25 13:20:23,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-07-25 13:20:23,183 INFO L78 Accepts]: Start accepts. Automaton has 235 states. Word has length 235 [2018-07-25 13:20:23,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:23,184 INFO L225 Difference]: With dead ends: 239 [2018-07-25 13:20:23,184 INFO L226 Difference]: Without dead ends: 237 [2018-07-25 13:20:23,189 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=27495, Invalid=27495, Unknown=0, NotChecked=0, Total=54990 [2018-07-25 13:20:23,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-25 13:20:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-25 13:20:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-25 13:20:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-25 13:20:23,192 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 235 [2018-07-25 13:20:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:23,192 INFO L472 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-25 13:20:23,192 INFO L473 AbstractCegarLoop]: Interpolant automaton has 235 states. [2018-07-25 13:20:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-25 13:20:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-25 13:20:23,193 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:23,193 INFO L354 BasicCegarLoop]: trace histogram [233, 1, 1, 1] [2018-07-25 13:20:23,193 INFO L415 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:23,193 INFO L82 PathProgramCache]: Analyzing trace with hash -87206488, now seen corresponding path program 233 times [2018-07-25 13:20:23,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 27261 backedges. 0 proven. 27261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:24,992 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:24,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [235] total 235 [2018-07-25 13:20:24,992 INFO L451 AbstractCegarLoop]: Interpolant automaton has 236 states [2018-07-25 13:20:24,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 236 interpolants. [2018-07-25 13:20:25,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27730, Invalid=27730, Unknown=0, NotChecked=0, Total=55460 [2018-07-25 13:20:25,000 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 236 states. [2018-07-25 13:20:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:26,536 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-07-25 13:20:26,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2018-07-25 13:20:26,537 INFO L78 Accepts]: Start accepts. Automaton has 236 states. Word has length 236 [2018-07-25 13:20:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:26,537 INFO L225 Difference]: With dead ends: 240 [2018-07-25 13:20:26,537 INFO L226 Difference]: Without dead ends: 238 [2018-07-25 13:20:26,541 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=27730, Invalid=27730, Unknown=0, NotChecked=0, Total=55460 [2018-07-25 13:20:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-07-25 13:20:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-07-25 13:20:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-07-25 13:20:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-07-25 13:20:26,544 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 236 [2018-07-25 13:20:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:26,544 INFO L472 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-07-25 13:20:26,544 INFO L473 AbstractCegarLoop]: Interpolant automaton has 236 states. [2018-07-25 13:20:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-07-25 13:20:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-07-25 13:20:26,545 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:26,545 INFO L354 BasicCegarLoop]: trace histogram [234, 1, 1, 1] [2018-07-25 13:20:26,545 INFO L415 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1591564193, now seen corresponding path program 234 times [2018-07-25 13:20:26,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 27495 backedges. 0 proven. 27495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:28,426 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:28,426 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [236] total 236 [2018-07-25 13:20:28,426 INFO L451 AbstractCegarLoop]: Interpolant automaton has 237 states [2018-07-25 13:20:28,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 237 interpolants. [2018-07-25 13:20:28,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27966, Invalid=27966, Unknown=0, NotChecked=0, Total=55932 [2018-07-25 13:20:28,431 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 237 states. [2018-07-25 13:20:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:29,901 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-07-25 13:20:29,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2018-07-25 13:20:29,902 INFO L78 Accepts]: Start accepts. Automaton has 237 states. Word has length 237 [2018-07-25 13:20:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:29,902 INFO L225 Difference]: With dead ends: 241 [2018-07-25 13:20:29,902 INFO L226 Difference]: Without dead ends: 239 [2018-07-25 13:20:29,905 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=27966, Invalid=27966, Unknown=0, NotChecked=0, Total=55932 [2018-07-25 13:20:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-25 13:20:29,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-25 13:20:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-25 13:20:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-25 13:20:29,908 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 237 [2018-07-25 13:20:29,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:29,908 INFO L472 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-25 13:20:29,908 INFO L473 AbstractCegarLoop]: Interpolant automaton has 237 states. [2018-07-25 13:20:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-25 13:20:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-25 13:20:29,909 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:29,909 INFO L354 BasicCegarLoop]: trace histogram [235, 1, 1, 1] [2018-07-25 13:20:29,909 INFO L415 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:29,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2093847752, now seen corresponding path program 235 times [2018-07-25 13:20:29,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 27730 backedges. 0 proven. 27730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:31,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:31,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [237] total 237 [2018-07-25 13:20:31,721 INFO L451 AbstractCegarLoop]: Interpolant automaton has 238 states [2018-07-25 13:20:31,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 238 interpolants. [2018-07-25 13:20:31,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28203, Invalid=28203, Unknown=0, NotChecked=0, Total=56406 [2018-07-25 13:20:31,730 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 238 states. [2018-07-25 13:20:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:33,536 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-07-25 13:20:33,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2018-07-25 13:20:33,536 INFO L78 Accepts]: Start accepts. Automaton has 238 states. Word has length 238 [2018-07-25 13:20:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:33,536 INFO L225 Difference]: With dead ends: 242 [2018-07-25 13:20:33,536 INFO L226 Difference]: Without dead ends: 240 [2018-07-25 13:20:33,541 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=28203, Invalid=28203, Unknown=0, NotChecked=0, Total=56406 [2018-07-25 13:20:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-07-25 13:20:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-07-25 13:20:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-07-25 13:20:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-07-25 13:20:33,544 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 238 [2018-07-25 13:20:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:33,544 INFO L472 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-07-25 13:20:33,544 INFO L473 AbstractCegarLoop]: Interpolant automaton has 238 states. [2018-07-25 13:20:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-07-25 13:20:33,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-07-25 13:20:33,545 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:33,545 INFO L354 BasicCegarLoop]: trace histogram [236, 1, 1, 1] [2018-07-25 13:20:33,545 INFO L415 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:33,545 INFO L82 PathProgramCache]: Analyzing trace with hash 484768897, now seen corresponding path program 236 times [2018-07-25 13:20:33,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 27966 backedges. 0 proven. 27966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:35,426 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:35,426 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [238] total 238 [2018-07-25 13:20:35,426 INFO L451 AbstractCegarLoop]: Interpolant automaton has 239 states [2018-07-25 13:20:35,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 239 interpolants. [2018-07-25 13:20:35,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28441, Invalid=28441, Unknown=0, NotChecked=0, Total=56882 [2018-07-25 13:20:35,435 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 239 states. [2018-07-25 13:20:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:36,791 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-25 13:20:36,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2018-07-25 13:20:36,791 INFO L78 Accepts]: Start accepts. Automaton has 239 states. Word has length 239 [2018-07-25 13:20:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:36,792 INFO L225 Difference]: With dead ends: 243 [2018-07-25 13:20:36,792 INFO L226 Difference]: Without dead ends: 241 [2018-07-25 13:20:36,796 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=28441, Invalid=28441, Unknown=0, NotChecked=0, Total=56882 [2018-07-25 13:20:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-25 13:20:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-25 13:20:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 13:20:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-25 13:20:36,799 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 239 [2018-07-25 13:20:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:36,799 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-25 13:20:36,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 239 states. [2018-07-25 13:20:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-25 13:20:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-25 13:20:36,800 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:36,800 INFO L354 BasicCegarLoop]: trace histogram [237, 1, 1, 1] [2018-07-25 13:20:36,800 INFO L415 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:36,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2142931944, now seen corresponding path program 237 times [2018-07-25 13:20:36,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 28203 backedges. 0 proven. 28203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:38,628 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:38,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [239] total 239 [2018-07-25 13:20:38,629 INFO L451 AbstractCegarLoop]: Interpolant automaton has 240 states [2018-07-25 13:20:38,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 240 interpolants. [2018-07-25 13:20:38,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28680, Invalid=28680, Unknown=0, NotChecked=0, Total=57360 [2018-07-25 13:20:38,634 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 240 states. [2018-07-25 13:20:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:39,820 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-07-25 13:20:39,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2018-07-25 13:20:39,820 INFO L78 Accepts]: Start accepts. Automaton has 240 states. Word has length 240 [2018-07-25 13:20:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:39,821 INFO L225 Difference]: With dead ends: 244 [2018-07-25 13:20:39,821 INFO L226 Difference]: Without dead ends: 242 [2018-07-25 13:20:39,824 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=28680, Invalid=28680, Unknown=0, NotChecked=0, Total=57360 [2018-07-25 13:20:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-25 13:20:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-07-25 13:20:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-07-25 13:20:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-07-25 13:20:39,826 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 240 [2018-07-25 13:20:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:39,827 INFO L472 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-07-25 13:20:39,827 INFO L473 AbstractCegarLoop]: Interpolant automaton has 240 states. [2018-07-25 13:20:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-07-25 13:20:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-07-25 13:20:39,828 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:39,828 INFO L354 BasicCegarLoop]: trace histogram [238, 1, 1, 1] [2018-07-25 13:20:39,828 INFO L415 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2006378849, now seen corresponding path program 238 times [2018-07-25 13:20:39,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 28441 backedges. 0 proven. 28441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:41,798 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:41,798 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [240] total 240 [2018-07-25 13:20:41,798 INFO L451 AbstractCegarLoop]: Interpolant automaton has 241 states [2018-07-25 13:20:41,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 241 interpolants. [2018-07-25 13:20:41,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28920, Invalid=28920, Unknown=0, NotChecked=0, Total=57840 [2018-07-25 13:20:41,808 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 241 states. [2018-07-25 13:20:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:44,443 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-25 13:20:44,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-07-25 13:20:44,443 INFO L78 Accepts]: Start accepts. Automaton has 241 states. Word has length 241 [2018-07-25 13:20:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:44,444 INFO L225 Difference]: With dead ends: 245 [2018-07-25 13:20:44,444 INFO L226 Difference]: Without dead ends: 243 [2018-07-25 13:20:44,450 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=28920, Invalid=28920, Unknown=0, NotChecked=0, Total=57840 [2018-07-25 13:20:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-25 13:20:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-25 13:20:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-25 13:20:44,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-07-25 13:20:44,454 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 241 [2018-07-25 13:20:44,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:44,454 INFO L472 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-07-25 13:20:44,454 INFO L473 AbstractCegarLoop]: Interpolant automaton has 241 states. [2018-07-25 13:20:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-07-25 13:20:44,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-25 13:20:44,455 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:44,455 INFO L354 BasicCegarLoop]: trace histogram [239, 1, 1, 1] [2018-07-25 13:20:44,455 INFO L415 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2068200200, now seen corresponding path program 239 times [2018-07-25 13:20:44,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 28680 backedges. 0 proven. 28680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:46,408 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:46,409 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [241] total 241 [2018-07-25 13:20:46,409 INFO L451 AbstractCegarLoop]: Interpolant automaton has 242 states [2018-07-25 13:20:46,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2018-07-25 13:20:46,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29161, Invalid=29161, Unknown=0, NotChecked=0, Total=58322 [2018-07-25 13:20:46,420 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 242 states. [2018-07-25 13:20:48,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:48,255 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-07-25 13:20:48,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2018-07-25 13:20:48,255 INFO L78 Accepts]: Start accepts. Automaton has 242 states. Word has length 242 [2018-07-25 13:20:48,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:48,256 INFO L225 Difference]: With dead ends: 246 [2018-07-25 13:20:48,256 INFO L226 Difference]: Without dead ends: 244 [2018-07-25 13:20:48,260 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=29161, Invalid=29161, Unknown=0, NotChecked=0, Total=58322 [2018-07-25 13:20:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-07-25 13:20:48,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-07-25 13:20:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-07-25 13:20:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-07-25 13:20:48,262 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 242 [2018-07-25 13:20:48,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:48,263 INFO L472 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-07-25 13:20:48,263 INFO L473 AbstractCegarLoop]: Interpolant automaton has 242 states. [2018-07-25 13:20:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-07-25 13:20:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-07-25 13:20:48,263 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:48,264 INFO L354 BasicCegarLoop]: trace histogram [240, 1, 1, 1] [2018-07-25 13:20:48,264 INFO L415 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:48,264 INFO L82 PathProgramCache]: Analyzing trace with hash -310305215, now seen corresponding path program 240 times [2018-07-25 13:20:48,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 28920 backedges. 0 proven. 28920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:50,091 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:50,091 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [242] total 242 [2018-07-25 13:20:50,092 INFO L451 AbstractCegarLoop]: Interpolant automaton has 243 states [2018-07-25 13:20:50,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 243 interpolants. [2018-07-25 13:20:50,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29403, Invalid=29403, Unknown=0, NotChecked=0, Total=58806 [2018-07-25 13:20:50,097 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 243 states. [2018-07-25 13:20:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:50,733 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-25 13:20:50,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2018-07-25 13:20:50,734 INFO L78 Accepts]: Start accepts. Automaton has 243 states. Word has length 243 [2018-07-25 13:20:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:50,734 INFO L225 Difference]: With dead ends: 247 [2018-07-25 13:20:50,734 INFO L226 Difference]: Without dead ends: 245 [2018-07-25 13:20:50,736 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=29403, Invalid=29403, Unknown=0, NotChecked=0, Total=58806 [2018-07-25 13:20:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-25 13:20:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-25 13:20:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 13:20:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-25 13:20:50,739 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 243 [2018-07-25 13:20:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:50,739 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-25 13:20:50,739 INFO L473 AbstractCegarLoop]: Interpolant automaton has 243 states. [2018-07-25 13:20:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-25 13:20:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-25 13:20:50,740 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:50,740 INFO L354 BasicCegarLoop]: trace histogram [241, 1, 1, 1] [2018-07-25 13:20:50,740 INFO L415 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:50,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1029529048, now seen corresponding path program 241 times [2018-07-25 13:20:50,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 29161 backedges. 0 proven. 29161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:52,724 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:52,724 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [243] total 243 [2018-07-25 13:20:52,725 INFO L451 AbstractCegarLoop]: Interpolant automaton has 244 states [2018-07-25 13:20:52,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 244 interpolants. [2018-07-25 13:20:52,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29646, Invalid=29646, Unknown=0, NotChecked=0, Total=59292 [2018-07-25 13:20:52,735 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 244 states. [2018-07-25 13:20:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:55,097 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-07-25 13:20:55,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2018-07-25 13:20:55,098 INFO L78 Accepts]: Start accepts. Automaton has 244 states. Word has length 244 [2018-07-25 13:20:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:55,098 INFO L225 Difference]: With dead ends: 248 [2018-07-25 13:20:55,098 INFO L226 Difference]: Without dead ends: 246 [2018-07-25 13:20:55,104 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=29646, Invalid=29646, Unknown=0, NotChecked=0, Total=59292 [2018-07-25 13:20:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-07-25 13:20:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-07-25 13:20:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-07-25 13:20:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-07-25 13:20:55,108 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 244 [2018-07-25 13:20:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:55,108 INFO L472 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-07-25 13:20:55,108 INFO L473 AbstractCegarLoop]: Interpolant automaton has 244 states. [2018-07-25 13:20:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-07-25 13:20:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-07-25 13:20:55,109 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:55,109 INFO L354 BasicCegarLoop]: trace histogram [242, 1, 1, 1] [2018-07-25 13:20:55,109 INFO L415 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:55,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1850631391, now seen corresponding path program 242 times [2018-07-25 13:20:55,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 29403 backedges. 0 proven. 29403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:57,042 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:57,042 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [244] total 244 [2018-07-25 13:20:57,042 INFO L451 AbstractCegarLoop]: Interpolant automaton has 245 states [2018-07-25 13:20:57,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2018-07-25 13:20:57,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29890, Invalid=29890, Unknown=0, NotChecked=0, Total=59780 [2018-07-25 13:20:57,052 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 245 states. [2018-07-25 13:20:59,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:59,301 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-25 13:20:59,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2018-07-25 13:20:59,302 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 245 [2018-07-25 13:20:59,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:59,302 INFO L225 Difference]: With dead ends: 249 [2018-07-25 13:20:59,302 INFO L226 Difference]: Without dead ends: 247 [2018-07-25 13:20:59,309 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=29890, Invalid=29890, Unknown=0, NotChecked=0, Total=59780 [2018-07-25 13:20:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-25 13:20:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-25 13:20:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-25 13:20:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-07-25 13:20:59,312 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 245 [2018-07-25 13:20:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:59,313 INFO L472 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-07-25 13:20:59,313 INFO L473 AbstractCegarLoop]: Interpolant automaton has 245 states. [2018-07-25 13:20:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-07-25 13:20:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-25 13:20:59,314 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:59,314 INFO L354 BasicCegarLoop]: trace histogram [243, 1, 1, 1] [2018-07-25 13:20:59,314 INFO L415 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:59,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1535000248, now seen corresponding path program 243 times [2018-07-25 13:20:59,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 29646 backedges. 0 proven. 29646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:01,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:01,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [245] total 245 [2018-07-25 13:21:01,442 INFO L451 AbstractCegarLoop]: Interpolant automaton has 246 states [2018-07-25 13:21:01,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 246 interpolants. [2018-07-25 13:21:01,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30135, Invalid=30135, Unknown=0, NotChecked=0, Total=60270 [2018-07-25 13:21:01,447 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 246 states. Received shutdown request... [2018-07-25 13:21:03,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2018-07-25 13:21:03,175 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:21:03,180 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:21:03,181 INFO L202 PluginConnector]: Adding new model count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:21:03 BoogieIcfgContainer [2018-07-25 13:21:03,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:21:03,182 INFO L168 Benchmark]: Toolchain (without parser) took 260561.57 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 744.7 MB. Max. memory is 7.1 GB. [2018-07-25 13:21:03,185 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:21:03,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.53 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:21:03,185 INFO L168 Benchmark]: Boogie Preprocessor took 23.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:21:03,186 INFO L168 Benchmark]: RCFGBuilder took 194.91 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:21:03,186 INFO L168 Benchmark]: TraceAbstraction took 260295.48 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 734.1 MB. Max. memory is 7.1 GB. [2018-07-25 13:21:03,188 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 194.91 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 260295.48 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 734.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 32). Cancelled while BasicCegarLoop was constructing difference of abstraction (247states) and interpolant automaton (currently 228 states, 246 states before enhancement), while ReachableStatesComputation was computing reachable states (226 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 260.2s OverallTime, 244 OverallIterations, 243 TraceHistogramMax, 100.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 730 SDtfs, 0 SDslu, 15685 SDs, 0 SdLazy, 45799 SolverSat, 461 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30134 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 29890 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 119.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 243 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 24.2s SatisfiabilityAnalysisTime, 128.9s InterpolantComputationTime, 30378 NumberOfCodeBlocks, 30378 NumberOfCodeBlocksAsserted, 244 NumberOfCheckSat, 30134 ConstructedInterpolants, 0 QuantifiedInterpolants, 14736014 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 244 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2421090 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/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-21-03-199.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-21-03-199.csv Completed graceful shutdown