java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:10:31,047 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:10:31,049 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:10:31,060 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:10:31,060 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:10:31,061 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:10:31,063 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:10:31,064 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:10:31,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:10:31,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:10:31,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:10:31,068 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:10:31,069 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:10:31,070 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:10:31,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:10:31,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:10:31,073 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:10:31,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:10:31,078 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:10:31,079 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:10:31,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:10:31,085 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:10:31,088 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:10:31,088 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:10:31,088 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:10:31,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:10:31,094 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:10:31,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:10:31,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:10:31,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:10:31,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:10:31,102 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:10:31,102 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:10:31,103 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:10:31,104 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:10:31,104 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:10:31,105 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:10:31,123 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:10:31,123 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:10:31,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:10:31,126 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:10:31,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:10:31,128 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:10:31,128 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:10:31,128 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:10:31,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:10:31,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:10:31,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:10:31,213 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:10:31,214 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:10:31,214 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-09-26 08:10:31,215 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl' [2018-09-26 08:10:31,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:10:31,271 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:10:31,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:10:31,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:10:31,272 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:10:31,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,307 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:10:31,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:10:31,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:10:31,315 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:10:31,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:10:31,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:10:31,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:10:31,338 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:10:31,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,433 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-26 08:10:31,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:10:31,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:10:31,608 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:10:31,609 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:10:31 BoogieIcfgContainer [2018-09-26 08:10:31,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:10:31,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:10:31,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:10:31,615 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:10:31,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/2) ... [2018-09-26 08:10:31,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643c4b1d and model type fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:10:31, skipping insertion in model container [2018-09-26 08:10:31,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:10:31" (2/2) ... [2018-09-26 08:10:31,622 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-09-26 08:10:31,633 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:10:31,642 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:10:31,690 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:10:31,691 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:10:31,692 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:10:31,692 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:10:31,692 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:10:31,692 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:10:31,692 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:10:31,693 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:10:31,693 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:10:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-26 08:10:31,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:10:31,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:31,716 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:10:31,718 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:31,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:31,724 INFO L82 PathProgramCache]: Analyzing trace with hash 889618619, now seen corresponding path program 1 times [2018-09-26 08:10:31,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:31,805 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:31,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:10:31,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:10:31,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:10:31,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:10:31,829 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-09-26 08:10:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:31,859 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-09-26 08:10:31,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:10:31,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-09-26 08:10:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:31,873 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:10:31,873 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:10:31,877 INFO L605 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-09-26 08:10:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:10:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:10:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:10:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-26 08:10:31,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-09-26 08:10:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:31,917 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-26 08:10:31,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:10:31,918 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-26 08:10:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:10:31,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:31,919 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:31,919 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:31,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:31,920 INFO L82 PathProgramCache]: Analyzing trace with hash 141442743, now seen corresponding path program 1 times [2018-09-26 08:10:31,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:31,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:31,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:10:31,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:10:31,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:10:31,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:10:31,957 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2018-09-26 08:10:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:31,979 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-09-26 08:10:31,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:10:31,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-26 08:10:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:31,980 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:10:31,981 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:10:31,982 INFO L605 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-09-26 08:10:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:10:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:10:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:10:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-26 08:10:31,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-26 08:10:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:31,987 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-26 08:10:31,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:10:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-26 08:10:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:10:31,988 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:31,988 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-09-26 08:10:31,988 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:31,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:31,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1596035661, now seen corresponding path program 2 times [2018-09-26 08:10:31,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:10:32,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:10:32,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:10:32,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:32,042 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 5 states. [2018-09-26 08:10:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,075 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-09-26 08:10:32,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:10:32,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-09-26 08:10:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,077 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:10:32,077 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:10:32,078 INFO L605 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-09-26 08:10:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:10:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:10:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:10:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-26 08:10:32,085 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-26 08:10:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,087 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-26 08:10:32,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:10:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-26 08:10:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:10:32,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,089 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-09-26 08:10:32,089 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,089 INFO L82 PathProgramCache]: Analyzing trace with hash -570503761, now seen corresponding path program 3 times [2018-09-26 08:10:32,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,169 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:10:32,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:10:32,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:10:32,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:10:32,171 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-09-26 08:10:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,209 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-09-26 08:10:32,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:10:32,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-26 08:10:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,210 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:10:32,211 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:10:32,211 INFO L605 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-09-26 08:10:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:10:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:10:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:10:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-26 08:10:32,226 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-26 08:10:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,226 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-26 08:10:32,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:10:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-26 08:10:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:10:32,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,227 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-09-26 08:10:32,228 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1418141355, now seen corresponding path program 4 times [2018-09-26 08:10:32,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,275 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:10:32,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:10:32,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:10:32,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:32,278 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2018-09-26 08:10:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,317 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-09-26 08:10:32,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:10:32,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-09-26 08:10:32,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,318 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:10:32,318 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:10:32,319 INFO L605 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-09-26 08:10:32,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:10:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:10:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:10:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-26 08:10:32,324 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-09-26 08:10:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,324 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-26 08:10:32,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:10:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-26 08:10:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:10:32,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,326 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-09-26 08:10:32,326 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1245651111, now seen corresponding path program 5 times [2018-09-26 08:10:32,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:10:32,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:10:32,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:10:32,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:32,400 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 8 states. [2018-09-26 08:10:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,444 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-09-26 08:10:32,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:10:32,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:10:32,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,445 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:10:32,445 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:10:32,446 INFO L605 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-09-26 08:10:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:10:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:10:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:10:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-26 08:10:32,455 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-26 08:10:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,455 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-26 08:10:32,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:10:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-26 08:10:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:10:32,456 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,456 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-09-26 08:10:32,458 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1308716125, now seen corresponding path program 6 times [2018-09-26 08:10:32,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,547 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,547 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:10:32,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:10:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:10:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:32,549 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 9 states. [2018-09-26 08:10:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,592 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-09-26 08:10:32,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:10:32,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-09-26 08:10:32,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,595 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:10:32,595 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:10:32,597 INFO L605 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-09-26 08:10:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:10:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:10:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:10:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-09-26 08:10:32,607 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-09-26 08:10:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,607 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-09-26 08:10:32,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:10:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-09-26 08:10:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:10:32,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,611 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-09-26 08:10:32,612 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,612 INFO L82 PathProgramCache]: Analyzing trace with hash 665663391, now seen corresponding path program 7 times [2018-09-26 08:10:32,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,692 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:10:32,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:10:32,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:10:32,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:32,694 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-09-26 08:10:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,732 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-09-26 08:10:32,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:10:32,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-09-26 08:10:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,734 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:10:32,734 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:10:32,738 INFO L605 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-09-26 08:10:32,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:10:32,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:10:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:10:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-26 08:10:32,748 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-09-26 08:10:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,751 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-26 08:10:32,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:10:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-26 08:10:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:10:32,752 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,753 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-09-26 08:10:32,753 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash -331166565, now seen corresponding path program 8 times [2018-09-26 08:10:32,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,833 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:32,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:10:32,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:10:32,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:32,836 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 11 states. [2018-09-26 08:10:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,873 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-09-26 08:10:32,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:10:32,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-09-26 08:10:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,875 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:10:32,875 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:10:32,876 INFO L605 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-09-26 08:10:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:10:32,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:10:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:10:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-26 08:10:32,886 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-09-26 08:10:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,886 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-26 08:10:32,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:10:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-26 08:10:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:10:32,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,891 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2018-09-26 08:10:32,891 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,892 INFO L82 PathProgramCache]: Analyzing trace with hash -507047273, now seen corresponding path program 9 times [2018-09-26 08:10:32,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:32,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:32,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:32,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:32,939 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 12 states. [2018-09-26 08:10:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,962 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-09-26 08:10:32,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:10:32,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-09-26 08:10:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,964 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:10:32,964 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:10:32,964 INFO L605 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-09-26 08:10:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:10:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:10:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:10:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-26 08:10:32,970 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-26 08:10:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,970 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-26 08:10:32,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-26 08:10:32,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:10:32,972 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,972 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-09-26 08:10:32,972 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,973 INFO L82 PathProgramCache]: Analyzing trace with hash -2024683117, now seen corresponding path program 10 times [2018-09-26 08:10:32,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:10:33,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:10:33,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:10:33,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:10:33,025 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2018-09-26 08:10:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,053 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-09-26 08:10:33,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:10:33,054 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-09-26 08:10:33,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,055 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:10:33,055 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:10:33,056 INFO L605 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-09-26 08:10:33,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:10:33,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:10:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:10:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-26 08:10:33,061 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-09-26 08:10:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,062 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-26 08:10:33,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:10:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-26 08:10:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:10:33,063 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,063 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2018-09-26 08:10:33,064 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,064 INFO L82 PathProgramCache]: Analyzing trace with hash -183848561, now seen corresponding path program 11 times [2018-09-26 08:10:33,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:10:33,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:10:33,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:10:33,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:10:33,141 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2018-09-26 08:10:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,160 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-09-26 08:10:33,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:10:33,161 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-09-26 08:10:33,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,162 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:10:33,162 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:10:33,163 INFO L605 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-09-26 08:10:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:10:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:10:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:10:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-26 08:10:33,174 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-09-26 08:10:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,176 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-26 08:10:33,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:10:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-26 08:10:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:10:33,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,178 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2018-09-26 08:10:33,178 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash -668366197, now seen corresponding path program 12 times [2018-09-26 08:10:33,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:10:33,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:10:33,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:10:33,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:10:33,254 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 15 states. [2018-09-26 08:10:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,274 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-09-26 08:10:33,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:10:33,274 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-09-26 08:10:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,275 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:10:33,277 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:10:33,278 INFO L605 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-09-26 08:10:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:10:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:10:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:10:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-09-26 08:10:33,289 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-09-26 08:10:33,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,292 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-09-26 08:10:33,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:10:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-09-26 08:10:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:10:33,294 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,294 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2018-09-26 08:10:33,295 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1861620871, now seen corresponding path program 13 times [2018-09-26 08:10:33,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,383 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:10:33,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:10:33,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:10:33,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:10:33,385 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 16 states. [2018-09-26 08:10:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,414 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-09-26 08:10:33,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:10:33,414 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-09-26 08:10:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,415 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:10:33,415 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:10:33,417 INFO L605 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-09-26 08:10:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:10:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:10:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:10:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-26 08:10:33,423 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-09-26 08:10:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,427 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-26 08:10:33,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:10:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-26 08:10:33,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:10:33,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,429 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2018-09-26 08:10:33,429 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2067263613, now seen corresponding path program 14 times [2018-09-26 08:10:33,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,505 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:10:33,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:10:33,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:10:33,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:33,507 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 17 states. [2018-09-26 08:10:33,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,532 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-09-26 08:10:33,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:10:33,532 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-09-26 08:10:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,533 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:10:33,533 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:10:33,534 INFO L605 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-09-26 08:10:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:10:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:10:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:10:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-09-26 08:10:33,541 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-09-26 08:10:33,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,541 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-09-26 08:10:33,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:10:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-09-26 08:10:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:10:33,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,543 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2018-09-26 08:10:33,543 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1845967743, now seen corresponding path program 15 times [2018-09-26 08:10:33,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,624 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:10:33,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:10:33,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:10:33,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:10:33,627 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 18 states. [2018-09-26 08:10:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,656 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-09-26 08:10:33,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:10:33,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-09-26 08:10:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,657 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:10:33,661 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:10:33,661 INFO L605 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-09-26 08:10:33,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:10:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:10:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:10:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-26 08:10:33,673 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-09-26 08:10:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,673 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-26 08:10:33,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:10:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-26 08:10:33,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:10:33,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,678 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2018-09-26 08:10:33,678 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,681 INFO L82 PathProgramCache]: Analyzing trace with hash 69949563, now seen corresponding path program 16 times [2018-09-26 08:10:33,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,766 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:10:33,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:10:33,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:10:33,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:10:33,767 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 19 states. [2018-09-26 08:10:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,789 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-09-26 08:10:33,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:10:33,789 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-09-26 08:10:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,790 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:10:33,790 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:10:33,791 INFO L605 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-09-26 08:10:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:10:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:10:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:10:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-09-26 08:10:33,798 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-09-26 08:10:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,798 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-09-26 08:10:33,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:10:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-09-26 08:10:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:10:33,805 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,806 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2018-09-26 08:10:33,806 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1581504905, now seen corresponding path program 17 times [2018-09-26 08:10:33,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,917 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:10:33,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:10:33,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:10:33,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:10:33,920 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 20 states. [2018-09-26 08:10:33,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,944 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-09-26 08:10:33,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:10:33,945 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-09-26 08:10:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,945 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:10:33,946 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:10:33,946 INFO L605 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-09-26 08:10:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:10:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:10:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:10:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-26 08:10:33,951 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-09-26 08:10:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,952 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-26 08:10:33,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:10:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-26 08:10:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:10:33,953 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,954 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2018-09-26 08:10:33,954 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,955 INFO L82 PathProgramCache]: Analyzing trace with hash 508650867, now seen corresponding path program 18 times [2018-09-26 08:10:33,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:34,054 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:34,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:10:34,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:10:34,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:10:34,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:10:34,056 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 21 states. [2018-09-26 08:10:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,082 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-09-26 08:10:34,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:10:34,083 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-09-26 08:10:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,084 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:10:34,084 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:10:34,086 INFO L605 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-09-26 08:10:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:10:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:10:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:10:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-26 08:10:34,096 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-09-26 08:10:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,096 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-26 08:10:34,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:10:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-26 08:10:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:10:34,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,100 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2018-09-26 08:10:34,100 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,100 INFO L82 PathProgramCache]: Analyzing trace with hash -896346769, now seen corresponding path program 19 times [2018-09-26 08:10:34,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:34,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:34,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:10:34,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:10:34,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:10:34,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:10:34,199 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 22 states. [2018-09-26 08:10:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,223 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-09-26 08:10:34,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:10:34,223 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2018-09-26 08:10:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,224 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:10:34,224 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:10:34,225 INFO L605 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-09-26 08:10:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:10:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:10:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:10:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-26 08:10:34,235 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-09-26 08:10:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,235 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-26 08:10:34,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:10:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-26 08:10:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:10:34,236 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,236 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2018-09-26 08:10:34,241 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1815623275, now seen corresponding path program 20 times [2018-09-26 08:10:34,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:34,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:34,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:10:34,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:10:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:10:34,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:10:34,351 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 23 states. [2018-09-26 08:10:34,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,379 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-09-26 08:10:34,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:10:34,379 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2018-09-26 08:10:34,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,380 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:10:34,380 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:10:34,381 INFO L605 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-09-26 08:10:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:10:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:10:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:10:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-09-26 08:10:34,386 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-09-26 08:10:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,387 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-09-26 08:10:34,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:10:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-09-26 08:10:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:10:34,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,392 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2018-09-26 08:10:34,392 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash 973686887, now seen corresponding path program 21 times [2018-09-26 08:10:34,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:34,505 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:34,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:10:34,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:10:34,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:10:34,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:10:34,507 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 24 states. [2018-09-26 08:10:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,528 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-09-26 08:10:34,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:10:34,529 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2018-09-26 08:10:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,531 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:10:34,532 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:10:34,533 INFO L605 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-09-26 08:10:34,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:10:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:10:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:10:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-26 08:10:34,548 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-09-26 08:10:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,548 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-26 08:10:34,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:10:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-26 08:10:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:10:34,549 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,551 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2018-09-26 08:10:34,552 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash -673330333, now seen corresponding path program 22 times [2018-09-26 08:10:34,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:34,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:34,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:10:34,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:10:34,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:10:34,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:10:34,695 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 25 states. [2018-09-26 08:10:34,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,723 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-09-26 08:10:34,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:10:34,724 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-09-26 08:10:34,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,725 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:10:34,725 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:10:34,726 INFO L605 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-09-26 08:10:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:10:34,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:10:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:10:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-09-26 08:10:34,730 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-09-26 08:10:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,730 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-09-26 08:10:34,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:10:34,731 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-09-26 08:10:34,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:10:34,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,732 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2018-09-26 08:10:34,732 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1386053471, now seen corresponding path program 23 times [2018-09-26 08:10:34,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:34,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:34,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:10:34,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:10:34,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:10:34,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:10:34,860 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 26 states. [2018-09-26 08:10:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,877 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-09-26 08:10:34,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:10:34,877 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2018-09-26 08:10:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,878 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:10:34,878 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:10:34,879 INFO L605 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-09-26 08:10:34,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:10:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:10:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:10:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-26 08:10:34,889 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-09-26 08:10:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,889 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-26 08:10:34,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:10:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-26 08:10:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:10:34,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,890 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2018-09-26 08:10:34,890 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,891 INFO L82 PathProgramCache]: Analyzing trace with hash 473965659, now seen corresponding path program 24 times [2018-09-26 08:10:34,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,025 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:10:35,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:10:35,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:10:35,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:10:35,027 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 27 states. [2018-09-26 08:10:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,048 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-09-26 08:10:35,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:10:35,048 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2018-09-26 08:10:35,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,050 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:10:35,050 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:10:35,051 INFO L605 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-09-26 08:10:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:10:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:10:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:10:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-09-26 08:10:35,058 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-09-26 08:10:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,058 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-09-26 08:10:35,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:10:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-09-26 08:10:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:10:35,059 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,059 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2018-09-26 08:10:35,060 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,060 INFO L82 PathProgramCache]: Analyzing trace with hash 130906711, now seen corresponding path program 25 times [2018-09-26 08:10:35,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,203 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:10:35,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:10:35,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:10:35,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:10:35,205 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 28 states. [2018-09-26 08:10:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,227 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-09-26 08:10:35,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:10:35,228 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-09-26 08:10:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,229 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:10:35,229 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:10:35,230 INFO L605 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-09-26 08:10:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:10:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:10:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:10:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-26 08:10:35,234 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-09-26 08:10:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,234 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-26 08:10:35,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:10:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-26 08:10:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:10:35,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,235 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2018-09-26 08:10:35,235 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1163739475, now seen corresponding path program 26 times [2018-09-26 08:10:35,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,389 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:10:35,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:10:35,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:10:35,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:10:35,392 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 29 states. [2018-09-26 08:10:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,425 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-09-26 08:10:35,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:10:35,425 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2018-09-26 08:10:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,426 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:10:35,426 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:10:35,428 INFO L605 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-09-26 08:10:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:10:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:10:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:10:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-26 08:10:35,432 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-09-26 08:10:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,432 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-26 08:10:35,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:10:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-26 08:10:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:10:35,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,433 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2018-09-26 08:10:35,434 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1578580303, now seen corresponding path program 27 times [2018-09-26 08:10:35,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,590 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,590 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:10:35,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:10:35,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:10:35,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:10:35,592 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 30 states. [2018-09-26 08:10:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,620 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-26 08:10:35,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:10:35,621 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2018-09-26 08:10:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,622 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:10:35,622 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:10:35,623 INFO L605 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-09-26 08:10:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:10:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:10:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:10:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-26 08:10:35,627 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-09-26 08:10:35,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,627 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-26 08:10:35,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:10:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-26 08:10:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:10:35,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,628 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2018-09-26 08:10:35,629 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,629 INFO L82 PathProgramCache]: Analyzing trace with hash 808657483, now seen corresponding path program 28 times [2018-09-26 08:10:35,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,844 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:10:35,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:10:35,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:10:35,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:10:35,846 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 31 states. [2018-09-26 08:10:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,873 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-09-26 08:10:35,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:10:35,874 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2018-09-26 08:10:35,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,875 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:10:35,875 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:10:35,876 INFO L605 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-09-26 08:10:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:10:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:10:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:10:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-09-26 08:10:35,879 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-09-26 08:10:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,880 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-09-26 08:10:35,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:10:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-09-26 08:10:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:10:35,881 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,881 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2018-09-26 08:10:35,881 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash -352797625, now seen corresponding path program 29 times [2018-09-26 08:10:35,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,021 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:10:36,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:10:36,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:10:36,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:10:36,023 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 32 states. [2018-09-26 08:10:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,043 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-09-26 08:10:36,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:10:36,044 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-09-26 08:10:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,044 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:10:36,044 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:10:36,045 INFO L605 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-09-26 08:10:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:10:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:10:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:10:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-26 08:10:36,050 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-09-26 08:10:36,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,050 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-26 08:10:36,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:10:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-26 08:10:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:10:36,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,051 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2018-09-26 08:10:36,051 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,052 INFO L82 PathProgramCache]: Analyzing trace with hash 180340547, now seen corresponding path program 30 times [2018-09-26 08:10:36,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,212 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,212 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:10:36,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:10:36,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:10:36,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:10:36,214 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 33 states. [2018-09-26 08:10:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,241 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-09-26 08:10:36,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:10:36,242 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2018-09-26 08:10:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,242 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:10:36,242 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:10:36,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:10:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:10:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:10:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:10:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-09-26 08:10:36,247 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-09-26 08:10:36,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,247 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-09-26 08:10:36,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:10:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-09-26 08:10:36,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:10:36,248 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,248 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2018-09-26 08:10:36,248 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1425015615, now seen corresponding path program 31 times [2018-09-26 08:10:36,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:10:36,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:10:36,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:10:36,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:10:36,390 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 34 states. [2018-09-26 08:10:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,418 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-09-26 08:10:36,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:10:36,419 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 68 [2018-09-26 08:10:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,419 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:10:36,420 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:10:36,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:10:36,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:10:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:10:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:10:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-26 08:10:36,424 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-09-26 08:10:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,424 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-26 08:10:36,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:10:36,424 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-26 08:10:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:10:36,425 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,425 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2018-09-26 08:10:36,425 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,425 INFO L82 PathProgramCache]: Analyzing trace with hash -738119621, now seen corresponding path program 32 times [2018-09-26 08:10:36,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,555 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,555 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:10:36,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:10:36,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:10:36,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:10:36,557 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 35 states. [2018-09-26 08:10:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,588 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-09-26 08:10:36,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:10:36,589 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2018-09-26 08:10:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,589 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:10:36,589 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:10:36,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:10:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:10:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:10:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:10:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-09-26 08:10:36,594 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-09-26 08:10:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,595 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-09-26 08:10:36,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:10:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-09-26 08:10:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:10:36,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,595 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2018-09-26 08:10:36,596 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,596 INFO L82 PathProgramCache]: Analyzing trace with hash -746910153, now seen corresponding path program 33 times [2018-09-26 08:10:36,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,737 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:10:36,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:10:36,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:10:36,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:10:36,739 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 36 states. [2018-09-26 08:10:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,765 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-09-26 08:10:36,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:10:36,766 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2018-09-26 08:10:36,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,767 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:10:36,767 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:10:36,768 INFO L605 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-09-26 08:10:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:10:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:10:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:10:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-26 08:10:36,771 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-09-26 08:10:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,772 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-26 08:10:36,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:10:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-26 08:10:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:10:36,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,773 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2018-09-26 08:10:36,773 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash -604676813, now seen corresponding path program 34 times [2018-09-26 08:10:36,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,921 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:10:36,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:10:36,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:10:36,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:10:36,923 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 37 states. [2018-09-26 08:10:36,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,956 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-09-26 08:10:36,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:10:36,957 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2018-09-26 08:10:36,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,957 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:10:36,958 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:10:36,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:10:36,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:10:36,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:10:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:10:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-26 08:10:36,962 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-09-26 08:10:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,962 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-26 08:10:36,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:10:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-26 08:10:36,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:10:36,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,963 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2018-09-26 08:10:36,964 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1357390545, now seen corresponding path program 35 times [2018-09-26 08:10:36,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:37,116 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:37,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:10:37,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:10:37,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:10:37,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:10:37,118 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 38 states. [2018-09-26 08:10:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,142 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-09-26 08:10:37,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:10:37,142 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 76 [2018-09-26 08:10:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,143 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:10:37,143 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:10:37,144 INFO L605 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-09-26 08:10:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:10:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:10:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:10:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-26 08:10:37,148 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-09-26 08:10:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,148 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-26 08:10:37,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:10:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-26 08:10:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:10:37,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,149 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2018-09-26 08:10:37,149 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1134186027, now seen corresponding path program 36 times [2018-09-26 08:10:37,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:37,302 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:37,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:10:37,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:10:37,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:10:37,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:10:37,304 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 39 states. [2018-09-26 08:10:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,339 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-09-26 08:10:37,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:10:37,339 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 78 [2018-09-26 08:10:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,340 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:10:37,340 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:10:37,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:10:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:10:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:10:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:10:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-26 08:10:37,345 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-09-26 08:10:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,345 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-26 08:10:37,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:10:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-26 08:10:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:10:37,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,346 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2018-09-26 08:10:37,346 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1052479449, now seen corresponding path program 37 times [2018-09-26 08:10:37,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:37,506 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:37,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:10:37,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:10:37,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:10:37,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:10:37,508 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 40 states. [2018-09-26 08:10:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,546 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-09-26 08:10:37,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:10:37,546 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2018-09-26 08:10:37,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,547 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:10:37,547 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:10:37,548 INFO L605 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-09-26 08:10:37,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:10:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:10:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:10:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-26 08:10:37,553 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-09-26 08:10:37,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,554 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-26 08:10:37,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:10:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-26 08:10:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:10:37,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,555 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2018-09-26 08:10:37,555 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2095973155, now seen corresponding path program 38 times [2018-09-26 08:10:37,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:37,741 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:37,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:10:37,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:10:37,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:10:37,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:10:37,743 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 41 states. [2018-09-26 08:10:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,787 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-09-26 08:10:37,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:10:37,787 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 82 [2018-09-26 08:10:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,788 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:10:37,788 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:10:37,790 INFO L605 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-09-26 08:10:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:10:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:10:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:10:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-09-26 08:10:37,795 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-09-26 08:10:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,795 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-09-26 08:10:37,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:10:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-09-26 08:10:37,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:10:37,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,797 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2018-09-26 08:10:37,797 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,798 INFO L82 PathProgramCache]: Analyzing trace with hash -193018081, now seen corresponding path program 39 times [2018-09-26 08:10:37,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:38,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:38,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:10:38,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:10:38,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:10:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:10:38,010 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 42 states. [2018-09-26 08:10:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:38,054 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-09-26 08:10:38,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:10:38,054 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 84 [2018-09-26 08:10:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:38,055 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:10:38,055 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:10:38,057 INFO L605 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-09-26 08:10:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:10:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:10:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:10:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-26 08:10:38,061 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-09-26 08:10:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:38,062 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-26 08:10:38,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:10:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-26 08:10:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:10:38,063 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:38,063 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2018-09-26 08:10:38,063 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:38,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:38,064 INFO L82 PathProgramCache]: Analyzing trace with hash -890340325, now seen corresponding path program 40 times [2018-09-26 08:10:38,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:38,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:38,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:10:38,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:10:38,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:10:38,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:10:38,281 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 43 states. [2018-09-26 08:10:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:38,321 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-09-26 08:10:38,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:10:38,321 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 86 [2018-09-26 08:10:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:38,322 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:10:38,322 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:10:38,323 INFO L605 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-09-26 08:10:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:10:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:10:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:10:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-09-26 08:10:38,327 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-09-26 08:10:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:38,328 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-09-26 08:10:38,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:10:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-09-26 08:10:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:10:38,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:38,329 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2018-09-26 08:10:38,329 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:38,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:38,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1002118633, now seen corresponding path program 41 times [2018-09-26 08:10:38,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:38,497 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:38,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:10:38,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:10:38,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:10:38,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:10:38,500 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 44 states. [2018-09-26 08:10:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:38,530 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-09-26 08:10:38,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:10:38,530 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 88 [2018-09-26 08:10:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:38,531 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:10:38,531 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:10:38,532 INFO L605 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-09-26 08:10:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:10:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:10:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:10:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-26 08:10:38,536 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-09-26 08:10:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:38,537 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-26 08:10:38,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:10:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-26 08:10:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:10:38,538 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:38,538 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2018-09-26 08:10:38,538 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:38,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:38,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1046890221, now seen corresponding path program 42 times [2018-09-26 08:10:38,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:38,715 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:38,715 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:10:38,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:10:38,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:10:38,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:10:38,717 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 45 states. [2018-09-26 08:10:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:38,761 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-09-26 08:10:38,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:10:38,761 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 90 [2018-09-26 08:10:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:38,762 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:10:38,762 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:10:38,764 INFO L605 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-09-26 08:10:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:10:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:10:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:10:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-26 08:10:38,768 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-09-26 08:10:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:38,769 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-26 08:10:38,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:10:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-26 08:10:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:10:38,770 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:38,770 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2018-09-26 08:10:38,770 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:38,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:38,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1122713329, now seen corresponding path program 43 times [2018-09-26 08:10:38,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:38,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:38,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:10:38,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:10:38,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:10:38,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:10:38,966 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 46 states. [2018-09-26 08:10:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:39,002 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-09-26 08:10:39,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:10:39,002 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 92 [2018-09-26 08:10:39,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:39,003 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:10:39,003 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:10:39,004 INFO L605 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-09-26 08:10:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:10:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:10:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:10:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-26 08:10:39,009 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-09-26 08:10:39,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:39,009 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-26 08:10:39,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:10:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-26 08:10:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:10:39,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:39,010 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2018-09-26 08:10:39,011 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:39,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:39,011 INFO L82 PathProgramCache]: Analyzing trace with hash -974276085, now seen corresponding path program 44 times [2018-09-26 08:10:39,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:39,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:39,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:10:39,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:10:39,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:10:39,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:10:39,205 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 47 states. [2018-09-26 08:10:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:39,236 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-09-26 08:10:39,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:10:39,237 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 94 [2018-09-26 08:10:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:39,238 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:10:39,238 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:10:39,239 INFO L605 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-09-26 08:10:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:10:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:10:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:10:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-26 08:10:39,243 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-09-26 08:10:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:39,243 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-26 08:10:39,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:10:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-26 08:10:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:10:39,244 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:39,245 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2018-09-26 08:10:39,245 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:39,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:39,245 INFO L82 PathProgramCache]: Analyzing trace with hash -60005369, now seen corresponding path program 45 times [2018-09-26 08:10:39,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:39,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:39,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:10:39,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:10:39,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:10:39,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:10:39,448 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 48 states. [2018-09-26 08:10:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:39,481 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-09-26 08:10:39,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:10:39,481 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2018-09-26 08:10:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:39,482 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:10:39,482 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:10:39,483 INFO L605 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-09-26 08:10:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:10:39,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:10:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:10:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-26 08:10:39,487 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-09-26 08:10:39,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:39,488 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-26 08:10:39,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:10:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-26 08:10:39,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:10:39,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:39,489 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2018-09-26 08:10:39,489 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:39,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:39,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1914142973, now seen corresponding path program 46 times [2018-09-26 08:10:39,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:39,695 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:39,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:10:39,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:10:39,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:10:39,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:10:39,697 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 49 states. [2018-09-26 08:10:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:39,731 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-09-26 08:10:39,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:10:39,731 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 98 [2018-09-26 08:10:39,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:39,732 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:10:39,732 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:10:39,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:10:39,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:10:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:10:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:10:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-09-26 08:10:39,737 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-09-26 08:10:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:39,738 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-09-26 08:10:39,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:10:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-09-26 08:10:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:10:39,739 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:39,739 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2018-09-26 08:10:39,739 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:39,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:39,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1328952577, now seen corresponding path program 47 times [2018-09-26 08:10:39,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:39,961 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:39,962 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:10:39,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:10:39,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:10:39,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:10:39,964 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 50 states. [2018-09-26 08:10:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:40,007 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-09-26 08:10:40,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:10:40,008 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2018-09-26 08:10:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:40,009 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:10:40,009 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:10:40,011 INFO L605 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-09-26 08:10:40,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:10:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:10:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:10:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-26 08:10:40,016 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-09-26 08:10:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:40,016 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-26 08:10:40,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:10:40,016 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-26 08:10:40,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:10:40,017 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:40,018 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2018-09-26 08:10:40,018 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:40,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:40,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1601697797, now seen corresponding path program 48 times [2018-09-26 08:10:40,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:40,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:40,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:10:40,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:10:40,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:10:40,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:10:40,264 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 51 states. [2018-09-26 08:10:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:40,327 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2018-09-26 08:10:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:10:40,327 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 102 [2018-09-26 08:10:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:40,328 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:10:40,328 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:10:40,329 INFO L605 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-09-26 08:10:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:10:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:10:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:10:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-09-26 08:10:40,335 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-09-26 08:10:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:40,335 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-09-26 08:10:40,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:10:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-09-26 08:10:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:10:40,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:40,337 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2018-09-26 08:10:40,337 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:40,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1716849161, now seen corresponding path program 49 times [2018-09-26 08:10:40,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:40,615 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:40,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:10:40,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:10:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:10:40,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:10:40,618 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 52 states. [2018-09-26 08:10:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:40,662 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-09-26 08:10:40,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:10:40,662 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 104 [2018-09-26 08:10:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:40,663 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:10:40,663 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:10:40,665 INFO L605 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-09-26 08:10:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:10:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:10:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:10:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-26 08:10:40,671 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-09-26 08:10:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:40,671 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-26 08:10:40,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:10:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-26 08:10:40,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:10:40,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:40,673 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2018-09-26 08:10:40,673 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:40,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:40,674 INFO L82 PathProgramCache]: Analyzing trace with hash -708160269, now seen corresponding path program 50 times [2018-09-26 08:10:40,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:40,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:40,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:10:40,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:10:40,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:10:40,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:10:40,979 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 53 states. [2018-09-26 08:10:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:41,030 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-09-26 08:10:41,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:10:41,030 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 106 [2018-09-26 08:10:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:41,031 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:10:41,031 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:10:41,035 INFO L605 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-09-26 08:10:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:10:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:10:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:10:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-26 08:10:41,044 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-09-26 08:10:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:41,044 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-26 08:10:41,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:10:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-26 08:10:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:10:41,046 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:41,046 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2018-09-26 08:10:41,046 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:41,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:41,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2020743953, now seen corresponding path program 51 times [2018-09-26 08:10:41,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:41,307 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:41,307 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:10:41,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:10:41,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:10:41,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:10:41,309 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 54 states. [2018-09-26 08:10:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:41,377 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-26 08:10:41,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:10:41,378 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 108 [2018-09-26 08:10:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:41,379 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:10:41,379 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:10:41,380 INFO L605 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-09-26 08:10:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:10:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:10:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:10:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-26 08:10:41,385 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-09-26 08:10:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:41,385 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-26 08:10:41,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:10:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-26 08:10:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:10:41,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:41,387 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2018-09-26 08:10:41,387 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:41,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash -693279253, now seen corresponding path program 52 times [2018-09-26 08:10:41,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:41,657 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:41,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:10:41,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:10:41,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:10:41,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:10:41,659 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 55 states. [2018-09-26 08:10:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:41,727 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-09-26 08:10:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:10:41,728 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 110 [2018-09-26 08:10:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:41,729 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:10:41,729 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:10:41,730 INFO L605 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-09-26 08:10:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:10:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:10:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:10:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-09-26 08:10:41,738 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-09-26 08:10:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:41,738 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-09-26 08:10:41,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:10:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-09-26 08:10:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:10:41,739 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:41,739 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2018-09-26 08:10:41,740 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:41,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:41,740 INFO L82 PathProgramCache]: Analyzing trace with hash -604989465, now seen corresponding path program 53 times [2018-09-26 08:10:41,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:42,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:42,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:10:42,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:10:42,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:10:42,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:10:42,013 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 56 states. [2018-09-26 08:10:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:42,089 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-09-26 08:10:42,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:10:42,089 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 112 [2018-09-26 08:10:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:42,090 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:10:42,091 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:10:42,092 INFO L605 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-09-26 08:10:42,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:10:42,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:10:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:10:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-26 08:10:42,097 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-09-26 08:10:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:42,098 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-26 08:10:42,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:10:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-26 08:10:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:10:42,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:42,100 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2018-09-26 08:10:42,101 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:42,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:42,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1657849117, now seen corresponding path program 54 times [2018-09-26 08:10:42,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:42,368 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:42,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:10:42,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:10:42,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:10:42,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:10:42,370 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 57 states. [2018-09-26 08:10:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:42,446 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-09-26 08:10:42,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:10:42,446 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 114 [2018-09-26 08:10:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:42,447 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:10:42,448 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:10:42,449 INFO L605 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-09-26 08:10:42,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:10:42,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:10:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:10:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-09-26 08:10:42,453 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-09-26 08:10:42,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:42,454 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-09-26 08:10:42,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:10:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-09-26 08:10:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:10:42,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:42,455 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1] [2018-09-26 08:10:42,456 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:42,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:42,456 INFO L82 PathProgramCache]: Analyzing trace with hash 156307167, now seen corresponding path program 55 times [2018-09-26 08:10:42,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:42,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:42,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:10:42,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:10:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:10:42,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:10:42,741 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 58 states. [2018-09-26 08:10:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:42,785 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-09-26 08:10:42,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:10:42,785 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 116 [2018-09-26 08:10:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:42,786 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:10:42,786 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:10:42,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:10:42,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:10:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:10:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:10:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-26 08:10:42,792 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2018-09-26 08:10:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:42,792 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-26 08:10:42,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:10:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-26 08:10:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:10:42,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:42,794 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1] [2018-09-26 08:10:42,794 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:42,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:42,794 INFO L82 PathProgramCache]: Analyzing trace with hash -196226085, now seen corresponding path program 56 times [2018-09-26 08:10:42,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:43,080 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:43,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:10:43,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:10:43,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:10:43,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:10:43,086 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 59 states. [2018-09-26 08:10:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:43,162 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-09-26 08:10:43,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:10:43,163 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 118 [2018-09-26 08:10:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:43,164 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:10:43,164 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:10:43,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:10:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:10:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:10:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:10:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-09-26 08:10:43,170 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2018-09-26 08:10:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:43,171 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-09-26 08:10:43,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:10:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-09-26 08:10:43,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:10:43,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:43,172 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1] [2018-09-26 08:10:43,173 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:43,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:43,173 INFO L82 PathProgramCache]: Analyzing trace with hash 321735127, now seen corresponding path program 57 times [2018-09-26 08:10:43,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:43,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:43,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:10:43,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:10:43,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:10:43,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:10:43,493 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 60 states. [2018-09-26 08:10:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:43,568 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-09-26 08:10:43,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:10:43,568 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 120 [2018-09-26 08:10:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:43,569 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:10:43,569 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:10:43,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:10:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:10:43,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:10:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:10:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-26 08:10:43,576 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-09-26 08:10:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:43,577 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-26 08:10:43,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:10:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-26 08:10:43,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:10:43,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:43,579 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1, 1, 1] [2018-09-26 08:10:43,579 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:43,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:43,579 INFO L82 PathProgramCache]: Analyzing trace with hash -133746477, now seen corresponding path program 58 times [2018-09-26 08:10:43,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:43,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:43,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:10:43,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:10:43,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:10:43,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:10:43,956 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 61 states. [2018-09-26 08:10:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:44,006 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2018-09-26 08:10:44,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:10:44,006 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 122 [2018-09-26 08:10:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:44,007 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:10:44,007 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:10:44,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:10:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:10:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:10:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:10:44,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-09-26 08:10:44,013 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-09-26 08:10:44,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:44,014 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-09-26 08:10:44,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:10:44,014 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-09-26 08:10:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:10:44,015 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:44,015 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1, 1, 1] [2018-09-26 08:10:44,016 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:44,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:44,016 INFO L82 PathProgramCache]: Analyzing trace with hash 235096271, now seen corresponding path program 59 times [2018-09-26 08:10:44,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:44,304 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:44,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:10:44,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:10:44,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:10:44,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:10:44,307 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 62 states. [2018-09-26 08:10:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:44,402 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-09-26 08:10:44,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:10:44,403 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 124 [2018-09-26 08:10:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:44,404 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:10:44,404 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:10:44,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:10:44,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:10:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:10:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:10:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-26 08:10:44,412 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2018-09-26 08:10:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:44,412 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-26 08:10:44,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:10:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-26 08:10:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:10:44,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:44,414 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1, 1, 1] [2018-09-26 08:10:44,414 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:44,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1789308469, now seen corresponding path program 60 times [2018-09-26 08:10:44,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:44,683 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:44,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:10:44,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:10:44,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:10:44,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:10:44,686 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 63 states. [2018-09-26 08:10:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:44,749 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-09-26 08:10:44,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:10:44,749 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 126 [2018-09-26 08:10:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:44,750 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:10:44,750 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:10:44,752 INFO L605 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-09-26 08:10:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:10:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:10:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:10:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-26 08:10:44,758 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-09-26 08:10:44,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:44,758 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-26 08:10:44,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:10:44,758 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-26 08:10:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:10:44,759 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:44,760 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1, 1, 1] [2018-09-26 08:10:44,760 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:44,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:44,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1622078521, now seen corresponding path program 61 times [2018-09-26 08:10:44,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:45,035 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:10:45,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:10:45,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:10:45,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:10:45,038 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 64 states. [2018-09-26 08:10:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,123 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-09-26 08:10:45,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:10:45,123 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 128 [2018-09-26 08:10:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,124 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:10:45,124 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:10:45,126 INFO L605 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-09-26 08:10:45,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:10:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:10:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:10:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-26 08:10:45,131 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-09-26 08:10:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,131 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-26 08:10:45,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:10:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-26 08:10:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:10:45,133 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,133 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1, 1, 1] [2018-09-26 08:10:45,133 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,134 INFO L82 PathProgramCache]: Analyzing trace with hash 172111555, now seen corresponding path program 62 times [2018-09-26 08:10:45,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:45,409 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:10:45,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:10:45,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:10:45,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:10:45,412 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 65 states. [2018-09-26 08:10:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,480 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-09-26 08:10:45,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:10:45,480 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 130 [2018-09-26 08:10:45,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,481 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:10:45,481 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:10:45,483 INFO L605 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-09-26 08:10:45,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:10:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:10:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:10:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-26 08:10:45,487 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-09-26 08:10:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,488 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-26 08:10:45,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:10:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-26 08:10:45,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:10:45,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,489 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1, 1, 1] [2018-09-26 08:10:45,490 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2106888895, now seen corresponding path program 63 times [2018-09-26 08:10:45,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:45,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:10:45,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:10:45,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:10:45,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:10:45,771 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 66 states. [2018-09-26 08:10:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,846 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-09-26 08:10:45,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:10:45,846 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 132 [2018-09-26 08:10:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,848 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:10:45,848 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:10:45,852 INFO L605 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-09-26 08:10:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:10:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:10:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:10:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-26 08:10:45,858 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-09-26 08:10:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,859 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-26 08:10:45,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:10:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-26 08:10:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:10:45,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,861 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1, 1, 1] [2018-09-26 08:10:45,861 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1707073467, now seen corresponding path program 64 times [2018-09-26 08:10:45,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:46,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:10:46,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:10:46,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:10:46,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:10:46,151 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 67 states. [2018-09-26 08:10:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:46,248 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2018-09-26 08:10:46,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:10:46,248 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 134 [2018-09-26 08:10:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:46,249 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:10:46,249 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:10:46,250 INFO L605 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-09-26 08:10:46,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:10:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:10:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:10:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-09-26 08:10:46,255 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2018-09-26 08:10:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,256 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-09-26 08:10:46,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:10:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-09-26 08:10:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:10:46,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,258 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1, 1, 1] [2018-09-26 08:10:46,258 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,258 INFO L82 PathProgramCache]: Analyzing trace with hash -263463497, now seen corresponding path program 65 times [2018-09-26 08:10:46,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:46,598 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:10:46,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:10:46,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:10:46,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:10:46,600 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 68 states. [2018-09-26 08:10:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:46,696 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2018-09-26 08:10:46,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:10:46,696 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 136 [2018-09-26 08:10:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:46,697 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:10:46,697 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:10:46,698 INFO L605 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-09-26 08:10:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:10:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:10:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:10:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-26 08:10:46,705 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-09-26 08:10:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,706 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-26 08:10:46,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:10:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-26 08:10:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:10:46,707 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,707 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1, 1, 1] [2018-09-26 08:10:46,708 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,708 INFO L82 PathProgramCache]: Analyzing trace with hash 131091635, now seen corresponding path program 66 times [2018-09-26 08:10:46,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:46,988 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:10:46,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:10:46,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:10:46,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:10:46,991 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 69 states. [2018-09-26 08:10:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:47,101 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-09-26 08:10:47,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:10:47,101 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 138 [2018-09-26 08:10:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:47,102 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:10:47,102 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:10:47,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:10:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:10:47,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:10:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:10:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-26 08:10:47,108 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-09-26 08:10:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:47,110 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-26 08:10:47,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:10:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-26 08:10:47,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:10:47,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:47,112 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1, 1, 1] [2018-09-26 08:10:47,112 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:47,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:47,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1341451439, now seen corresponding path program 67 times [2018-09-26 08:10:47,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:47,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:47,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:10:47,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:10:47,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:10:47,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:10:47,424 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 70 states. [2018-09-26 08:10:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:47,525 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-09-26 08:10:47,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:10:47,526 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 140 [2018-09-26 08:10:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:47,527 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:10:47,527 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:10:47,528 INFO L605 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-09-26 08:10:47,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:10:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:10:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:10:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-26 08:10:47,533 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-09-26 08:10:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:47,533 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-26 08:10:47,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:10:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-26 08:10:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:10:47,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:47,535 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1, 1, 1] [2018-09-26 08:10:47,535 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:47,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:47,536 INFO L82 PathProgramCache]: Analyzing trace with hash 561085867, now seen corresponding path program 68 times [2018-09-26 08:10:47,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:47,834 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:47,834 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:10:47,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:10:47,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:10:47,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:10:47,837 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 71 states. [2018-09-26 08:10:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:47,942 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2018-09-26 08:10:47,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:10:47,943 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 142 [2018-09-26 08:10:47,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:47,944 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:10:47,944 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:10:47,945 INFO L605 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-09-26 08:10:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:10:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:10:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:10:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-09-26 08:10:47,950 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-09-26 08:10:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:47,951 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-09-26 08:10:47,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:10:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-09-26 08:10:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:10:47,952 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:47,952 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1, 1, 1] [2018-09-26 08:10:47,953 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:47,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:47,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2045919321, now seen corresponding path program 69 times [2018-09-26 08:10:47,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:48,243 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:48,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:10:48,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:10:48,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:10:48,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:10:48,245 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 72 states. [2018-09-26 08:10:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:48,359 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2018-09-26 08:10:48,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:10:48,359 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 144 [2018-09-26 08:10:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:48,361 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:10:48,361 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:10:48,362 INFO L605 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-09-26 08:10:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:10:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:10:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:10:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-09-26 08:10:48,368 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-09-26 08:10:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:48,368 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-09-26 08:10:48,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:10:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-09-26 08:10:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:10:48,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:48,372 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1, 1, 1] [2018-09-26 08:10:48,372 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:48,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:48,373 INFO L82 PathProgramCache]: Analyzing trace with hash 882995875, now seen corresponding path program 70 times [2018-09-26 08:10:48,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:48,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:48,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:10:48,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:10:48,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:10:48,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:10:48,686 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 73 states. [2018-09-26 08:10:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:48,748 INFO L93 Difference]: Finished difference Result 153 states and 155 transitions. [2018-09-26 08:10:48,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:10:48,748 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 146 [2018-09-26 08:10:48,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:48,750 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:10:48,750 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:10:48,751 INFO L605 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-09-26 08:10:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:10:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:10:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:10:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-09-26 08:10:48,755 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-09-26 08:10:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:48,756 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-09-26 08:10:48,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:10:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-09-26 08:10:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:10:48,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:48,758 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1, 1, 1] [2018-09-26 08:10:48,758 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:48,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:48,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1928046945, now seen corresponding path program 71 times [2018-09-26 08:10:48,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:49,190 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:49,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:10:49,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:10:49,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:10:49,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:10:49,194 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 74 states. [2018-09-26 08:10:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:49,326 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2018-09-26 08:10:49,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:10:49,327 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 148 [2018-09-26 08:10:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:49,328 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:10:49,328 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:10:49,329 INFO L605 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-09-26 08:10:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:10:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:10:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:10:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-09-26 08:10:49,338 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2018-09-26 08:10:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:49,338 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-09-26 08:10:49,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:10:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-09-26 08:10:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:10:49,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:49,341 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1, 1, 1] [2018-09-26 08:10:49,341 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:49,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:49,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1805767781, now seen corresponding path program 72 times [2018-09-26 08:10:49,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:49,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:49,761 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:10:49,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:10:49,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:10:49,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:10:49,764 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 75 states. [2018-09-26 08:10:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:49,895 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-09-26 08:10:49,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:10:49,895 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 150 [2018-09-26 08:10:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:49,897 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:10:49,897 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:10:49,898 INFO L605 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-09-26 08:10:49,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:10:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:10:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:10:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-09-26 08:10:49,903 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-09-26 08:10:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:49,904 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-09-26 08:10:49,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:10:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-09-26 08:10:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:10:49,905 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:49,906 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1, 1, 1] [2018-09-26 08:10:49,906 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:49,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:49,906 INFO L82 PathProgramCache]: Analyzing trace with hash -259608169, now seen corresponding path program 73 times [2018-09-26 08:10:49,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:50,238 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:50,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:10:50,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:10:50,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:10:50,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:10:50,240 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 76 states. [2018-09-26 08:10:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:50,306 INFO L93 Difference]: Finished difference Result 159 states and 161 transitions. [2018-09-26 08:10:50,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:10:50,307 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 152 [2018-09-26 08:10:50,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:50,308 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:10:50,308 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:10:50,309 INFO L605 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-09-26 08:10:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:10:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:10:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:10:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-09-26 08:10:50,314 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-09-26 08:10:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:50,315 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-09-26 08:10:50,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:10:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-09-26 08:10:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:10:50,316 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:50,316 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1, 1, 1] [2018-09-26 08:10:50,317 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:50,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:50,317 INFO L82 PathProgramCache]: Analyzing trace with hash -458905453, now seen corresponding path program 74 times [2018-09-26 08:10:50,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:50,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:50,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:10:50,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:10:50,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:10:50,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:10:50,644 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 77 states. [2018-09-26 08:10:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:50,790 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-09-26 08:10:50,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:10:50,790 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 154 [2018-09-26 08:10:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:50,791 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:10:50,791 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:10:50,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:10:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:10:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:10:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:10:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-09-26 08:10:50,799 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-09-26 08:10:50,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:50,799 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-09-26 08:10:50,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:10:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-09-26 08:10:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:10:50,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:50,801 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1, 1, 1] [2018-09-26 08:10:50,802 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:50,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1289932943, now seen corresponding path program 75 times [2018-09-26 08:10:50,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:51,125 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:51,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:10:51,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:10:51,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:10:51,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:10:51,128 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 78 states. [2018-09-26 08:10:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:51,208 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-09-26 08:10:51,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:10:51,209 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 156 [2018-09-26 08:10:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:51,210 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:10:51,210 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:10:51,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:10:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:10:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:10:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:10:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-09-26 08:10:51,216 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-09-26 08:10:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:51,217 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-09-26 08:10:51,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:10:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-09-26 08:10:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:10:51,219 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:51,219 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1, 1, 1] [2018-09-26 08:10:51,219 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:51,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1703548533, now seen corresponding path program 76 times [2018-09-26 08:10:51,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:51,539 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:51,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:10:51,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:10:51,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:10:51,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:10:51,541 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 79 states. [2018-09-26 08:10:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:51,673 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2018-09-26 08:10:51,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:10:51,673 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 158 [2018-09-26 08:10:51,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:51,676 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:10:51,676 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:10:51,677 INFO L605 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-09-26 08:10:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:10:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:10:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:10:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-09-26 08:10:51,682 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2018-09-26 08:10:51,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:51,684 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-09-26 08:10:51,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:10:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-09-26 08:10:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:10:51,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:51,686 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1, 1, 1] [2018-09-26 08:10:51,686 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:51,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash -811158649, now seen corresponding path program 77 times [2018-09-26 08:10:51,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:52,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:52,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:10:52,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:10:52,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:10:52,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:10:52,033 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 80 states. [2018-09-26 08:10:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:52,204 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-09-26 08:10:52,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:10:52,204 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 160 [2018-09-26 08:10:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:52,206 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:10:52,206 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:10:52,206 INFO L605 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-09-26 08:10:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:10:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:10:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:10:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-09-26 08:10:52,214 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-09-26 08:10:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:52,214 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-09-26 08:10:52,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:10:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-09-26 08:10:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:10:52,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:52,216 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1, 1, 1] [2018-09-26 08:10:52,216 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:52,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:52,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2077027971, now seen corresponding path program 78 times [2018-09-26 08:10:52,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:52,574 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:52,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:10:52,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:10:52,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:10:52,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:10:52,576 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 81 states. [2018-09-26 08:10:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:52,721 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2018-09-26 08:10:52,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:10:52,721 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 162 [2018-09-26 08:10:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:52,722 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:10:52,722 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:10:52,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:10:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:10:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:10:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:10:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-09-26 08:10:52,728 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-09-26 08:10:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:52,728 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-09-26 08:10:52,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:10:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-09-26 08:10:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:10:52,730 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:52,730 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1, 1, 1] [2018-09-26 08:10:52,731 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:52,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:52,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1219470721, now seen corresponding path program 79 times [2018-09-26 08:10:52,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:53,039 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:53,039 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:10:53,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:10:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:10:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:10:53,041 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 82 states. [2018-09-26 08:10:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:53,129 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2018-09-26 08:10:53,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:10:53,129 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 164 [2018-09-26 08:10:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:53,130 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:10:53,130 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:10:53,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:10:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:10:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:10:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:10:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-09-26 08:10:53,136 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2018-09-26 08:10:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:53,136 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-09-26 08:10:53,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:10:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-09-26 08:10:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:10:53,138 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:53,138 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1, 1, 1] [2018-09-26 08:10:53,138 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:53,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:53,139 INFO L82 PathProgramCache]: Analyzing trace with hash 531150715, now seen corresponding path program 80 times [2018-09-26 08:10:53,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:53,486 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:53,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:10:53,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:10:53,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:10:53,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:10:53,488 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 83 states. [2018-09-26 08:10:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:53,561 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-09-26 08:10:53,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:10:53,561 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 166 [2018-09-26 08:10:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:53,563 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:10:53,563 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:10:53,564 INFO L605 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-09-26 08:10:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:10:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:10:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:10:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-09-26 08:10:53,568 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2018-09-26 08:10:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:53,569 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-09-26 08:10:53,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:10:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-09-26 08:10:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:10:53,571 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:53,571 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1, 1, 1] [2018-09-26 08:10:53,571 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:53,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:53,571 INFO L82 PathProgramCache]: Analyzing trace with hash -748829321, now seen corresponding path program 81 times [2018-09-26 08:10:53,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:53,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:53,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:10:53,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:10:53,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:10:53,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:10:53,867 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 84 states. [2018-09-26 08:10:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:53,923 INFO L93 Difference]: Finished difference Result 175 states and 177 transitions. [2018-09-26 08:10:53,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:10:53,924 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 168 [2018-09-26 08:10:53,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:53,925 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:10:53,925 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:10:53,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:10:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:10:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:10:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:10:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-09-26 08:10:53,931 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-09-26 08:10:53,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:53,931 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-09-26 08:10:53,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:10:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-09-26 08:10:53,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:10:53,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:53,933 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1, 1, 1] [2018-09-26 08:10:53,934 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:53,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:53,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1845970035, now seen corresponding path program 82 times [2018-09-26 08:10:53,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:10:54,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:10:54,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:10:54,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:10:54,283 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 85 states. [2018-09-26 08:10:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,376 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-09-26 08:10:54,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:10:54,376 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 170 [2018-09-26 08:10:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,378 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:10:54,378 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:10:54,378 INFO L605 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-09-26 08:10:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:10:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:10:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:10:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-09-26 08:10:54,385 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-09-26 08:10:54,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,385 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-09-26 08:10:54,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:10:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-09-26 08:10:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:10:54,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,387 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1, 1, 1] [2018-09-26 08:10:54,387 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,388 INFO L82 PathProgramCache]: Analyzing trace with hash 72152175, now seen corresponding path program 83 times [2018-09-26 08:10:54,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,839 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:10:54,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:10:54,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:10:54,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:10:54,842 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 86 states. [2018-09-26 08:10:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,028 INFO L93 Difference]: Finished difference Result 179 states and 181 transitions. [2018-09-26 08:10:55,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:10:55,029 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 172 [2018-09-26 08:10:55,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,030 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:10:55,030 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:10:55,032 INFO L605 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-09-26 08:10:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:10:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:10:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:10:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-09-26 08:10:55,038 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2018-09-26 08:10:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,038 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-09-26 08:10:55,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:10:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-09-26 08:10:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:10:55,041 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,041 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1, 1, 1] [2018-09-26 08:10:55,041 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,042 INFO L82 PathProgramCache]: Analyzing trace with hash 535205227, now seen corresponding path program 84 times [2018-09-26 08:10:55,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:55,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:10:55,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:10:55,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:10:55,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:10:55,578 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 87 states. [2018-09-26 08:10:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,707 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2018-09-26 08:10:55,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:10:55,707 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 174 [2018-09-26 08:10:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,708 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:10:55,708 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:10:55,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:10:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:10:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:10:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:10:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-09-26 08:10:55,713 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-09-26 08:10:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,714 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-09-26 08:10:55,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:10:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-09-26 08:10:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:10:55,716 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,716 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1, 1, 1] [2018-09-26 08:10:55,716 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1147410585, now seen corresponding path program 85 times [2018-09-26 08:10:55,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:56,098 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:10:56,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:10:56,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:10:56,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:10:56,100 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 88 states. [2018-09-26 08:10:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,284 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2018-09-26 08:10:56,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:10:56,284 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 176 [2018-09-26 08:10:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,286 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:10:56,286 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:10:56,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:10:56,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:10:56,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:10:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:10:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-09-26 08:10:56,292 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-09-26 08:10:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,292 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-09-26 08:10:56,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:10:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-09-26 08:10:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:10:56,295 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,295 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1, 1, 1] [2018-09-26 08:10:56,296 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1061464675, now seen corresponding path program 86 times [2018-09-26 08:10:56,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:56,707 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:10:56,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:10:56,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:10:56,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:10:56,710 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 89 states. [2018-09-26 08:10:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,813 INFO L93 Difference]: Finished difference Result 185 states and 187 transitions. [2018-09-26 08:10:56,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:10:56,813 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 178 [2018-09-26 08:10:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,814 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:10:56,814 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:10:56,815 INFO L605 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-09-26 08:10:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:10:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:10:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:10:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-09-26 08:10:56,820 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-09-26 08:10:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,820 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-09-26 08:10:56,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:10:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-09-26 08:10:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:10:56,822 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,823 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1, 1, 1] [2018-09-26 08:10:56,823 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2076745311, now seen corresponding path program 87 times [2018-09-26 08:10:56,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:57,210 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,210 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:10:57,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:10:57,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:10:57,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:10:57,212 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 90 states. [2018-09-26 08:10:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,357 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-09-26 08:10:57,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:10:57,357 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 180 [2018-09-26 08:10:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,358 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:10:57,358 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:10:57,359 INFO L605 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-09-26 08:10:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:10:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:10:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:10:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-09-26 08:10:57,364 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-09-26 08:10:57,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,364 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-09-26 08:10:57,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:10:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-09-26 08:10:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:10:57,366 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,366 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1, 1, 1] [2018-09-26 08:10:57,367 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1491106981, now seen corresponding path program 88 times [2018-09-26 08:10:57,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:57,766 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:10:57,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:10:57,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:10:57,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:10:57,768 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 91 states. [2018-09-26 08:10:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,831 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2018-09-26 08:10:57,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:10:57,831 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 182 [2018-09-26 08:10:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,832 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:10:57,832 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:10:57,833 INFO L605 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-09-26 08:10:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:10:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-09-26 08:10:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:10:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-09-26 08:10:57,839 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2018-09-26 08:10:57,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,840 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-09-26 08:10:57,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:10:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-09-26 08:10:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:10:57,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,841 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1, 1, 1] [2018-09-26 08:10:57,842 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1481709911, now seen corresponding path program 89 times [2018-09-26 08:10:57,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:58,160 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:58,160 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:10:58,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:10:58,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:10:58,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:10:58,161 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 92 states. [2018-09-26 08:10:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:58,302 INFO L93 Difference]: Finished difference Result 191 states and 193 transitions. [2018-09-26 08:10:58,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:10:58,302 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 184 [2018-09-26 08:10:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:58,303 INFO L225 Difference]: With dead ends: 191 [2018-09-26 08:10:58,303 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:10:58,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:10:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:10:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:10:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:10:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-09-26 08:10:58,308 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-09-26 08:10:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:58,309 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-09-26 08:10:58,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:10:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-09-26 08:10:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:10:58,310 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:58,310 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1, 1, 1] [2018-09-26 08:10:58,310 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:58,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:58,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2089476013, now seen corresponding path program 90 times [2018-09-26 08:10:58,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:58,699 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:58,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:10:58,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:10:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:10:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:10:58,701 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 93 states. [2018-09-26 08:10:58,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:58,850 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2018-09-26 08:10:58,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:10:58,851 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 186 [2018-09-26 08:10:58,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:58,853 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:10:58,853 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:10:58,854 INFO L605 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-09-26 08:10:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:10:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-09-26 08:10:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:10:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-09-26 08:10:58,863 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-09-26 08:10:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:58,863 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-09-26 08:10:58,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:10:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-09-26 08:10:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:10:58,865 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:58,866 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1, 1, 1] [2018-09-26 08:10:58,866 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:58,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1974687823, now seen corresponding path program 91 times [2018-09-26 08:10:58,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:59,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:59,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:10:59,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:10:59,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:10:59,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:10:59,209 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 94 states. [2018-09-26 08:10:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:59,312 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-09-26 08:10:59,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:10:59,312 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 188 [2018-09-26 08:10:59,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:59,313 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:10:59,314 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:10:59,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:10:59,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:10:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-26 08:10:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:10:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-09-26 08:10:59,319 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2018-09-26 08:10:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:59,319 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-09-26 08:10:59,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:10:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-09-26 08:10:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:10:59,321 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:59,321 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1, 1, 1] [2018-09-26 08:10:59,321 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:59,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:59,321 INFO L82 PathProgramCache]: Analyzing trace with hash -784105141, now seen corresponding path program 92 times [2018-09-26 08:10:59,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:59,638 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:59,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:10:59,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:10:59,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:10:59,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:10:59,640 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 95 states. [2018-09-26 08:10:59,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:59,804 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-09-26 08:10:59,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:10:59,804 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 190 [2018-09-26 08:10:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:59,805 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:10:59,805 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:10:59,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:10:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:10:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 08:10:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:10:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-09-26 08:10:59,809 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2018-09-26 08:10:59,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:59,809 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-09-26 08:10:59,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:10:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-09-26 08:10:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:10:59,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:59,810 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1, 1, 1] [2018-09-26 08:10:59,810 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:59,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:59,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1989321913, now seen corresponding path program 93 times [2018-09-26 08:10:59,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:00,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:00,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:11:00,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:11:00,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:11:00,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:11:00,104 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 96 states. [2018-09-26 08:11:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:00,258 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-09-26 08:11:00,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:11:00,258 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 192 [2018-09-26 08:11:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:00,259 INFO L225 Difference]: With dead ends: 199 [2018-09-26 08:11:00,259 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:11:00,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:11:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:11:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-26 08:11:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:11:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-09-26 08:11:00,263 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-09-26 08:11:00,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:00,263 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-09-26 08:11:00,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:11:00,263 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-09-26 08:11:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:11:00,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:00,264 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1, 1, 1] [2018-09-26 08:11:00,264 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:00,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash -561469885, now seen corresponding path program 94 times [2018-09-26 08:11:00,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:00,587 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:00,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:11:00,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:11:00,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:11:00,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:11:00,589 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 97 states. [2018-09-26 08:11:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:00,753 INFO L93 Difference]: Finished difference Result 201 states and 203 transitions. [2018-09-26 08:11:00,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:11:00,753 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 194 [2018-09-26 08:11:00,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:00,754 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:11:00,755 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:11:00,755 INFO L605 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-09-26 08:11:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:11:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-26 08:11:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:11:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-09-26 08:11:00,760 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-09-26 08:11:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:00,761 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-09-26 08:11:00,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:11:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-09-26 08:11:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:11:00,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:00,762 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1, 1, 1] [2018-09-26 08:11:00,762 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:00,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:00,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1509761599, now seen corresponding path program 95 times [2018-09-26 08:11:00,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:01,177 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:01,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:11:01,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:11:01,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:11:01,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:11:01,180 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 98 states. [2018-09-26 08:11:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:01,399 INFO L93 Difference]: Finished difference Result 203 states and 205 transitions. [2018-09-26 08:11:01,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:11:01,399 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 196 [2018-09-26 08:11:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:01,400 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:11:01,400 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:11:01,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:11:01,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:11:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-26 08:11:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:11:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-09-26 08:11:01,405 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2018-09-26 08:11:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:01,406 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-09-26 08:11:01,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:11:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-09-26 08:11:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:11:01,407 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:01,407 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1, 1, 1] [2018-09-26 08:11:01,407 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:01,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:01,408 INFO L82 PathProgramCache]: Analyzing trace with hash -901607621, now seen corresponding path program 96 times [2018-09-26 08:11:01,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:01,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:01,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:11:01,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:11:01,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:11:01,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:11:01,761 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 99 states. [2018-09-26 08:11:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:01,954 INFO L93 Difference]: Finished difference Result 205 states and 207 transitions. [2018-09-26 08:11:01,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:11:01,954 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 198 [2018-09-26 08:11:01,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:01,955 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:11:01,955 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:11:01,956 INFO L605 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-09-26 08:11:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:11:01,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-09-26 08:11:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:11:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-09-26 08:11:01,960 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-09-26 08:11:01,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:01,960 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-09-26 08:11:01,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:11:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-09-26 08:11:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:11:01,961 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:01,962 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1, 1, 1] [2018-09-26 08:11:01,962 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:01,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:01,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1054911799, now seen corresponding path program 97 times [2018-09-26 08:11:01,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:02,285 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:02,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:11:02,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:11:02,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:11:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:11:02,288 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 100 states. [2018-09-26 08:11:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:02,503 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-09-26 08:11:02,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:11:02,503 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 200 [2018-09-26 08:11:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:02,505 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:11:02,505 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:11:02,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:11:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:11:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:11:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:11:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-09-26 08:11:02,511 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-09-26 08:11:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:02,511 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-09-26 08:11:02,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:11:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-09-26 08:11:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:11:02,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:02,512 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1, 1, 1] [2018-09-26 08:11:02,513 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:02,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:02,513 INFO L82 PathProgramCache]: Analyzing trace with hash 74398771, now seen corresponding path program 98 times [2018-09-26 08:11:02,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:02,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:02,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:11:02,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:11:02,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:11:02,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:11:02,931 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 101 states. [2018-09-26 08:11:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:03,119 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2018-09-26 08:11:03,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:11:03,120 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 202 [2018-09-26 08:11:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:03,121 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:11:03,121 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:11:03,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:11:03,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:11:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:11:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:11:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-09-26 08:11:03,128 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-09-26 08:11:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:03,128 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-09-26 08:11:03,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:11:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-09-26 08:11:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:11:03,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:03,129 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1, 1, 1] [2018-09-26 08:11:03,130 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:03,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:03,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1600783313, now seen corresponding path program 99 times [2018-09-26 08:11:03,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:03,520 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:03,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:11:03,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:11:03,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:11:03,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:11:03,522 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 102 states. [2018-09-26 08:11:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:03,606 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-09-26 08:11:03,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:11:03,606 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 204 [2018-09-26 08:11:03,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:03,607 INFO L225 Difference]: With dead ends: 211 [2018-09-26 08:11:03,607 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:11:03,608 INFO L605 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-09-26 08:11:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:11:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-09-26 08:11:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:11:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-09-26 08:11:03,612 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-09-26 08:11:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:03,612 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-09-26 08:11:03,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:11:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-09-26 08:11:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:11:03,613 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:03,613 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1, 1, 1] [2018-09-26 08:11:03,614 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:03,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:03,614 INFO L82 PathProgramCache]: Analyzing trace with hash -838030037, now seen corresponding path program 100 times [2018-09-26 08:11:03,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:04,000 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:04,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:11:04,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:11:04,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:11:04,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:11:04,002 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 103 states. [2018-09-26 08:11:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:04,218 INFO L93 Difference]: Finished difference Result 213 states and 215 transitions. [2018-09-26 08:11:04,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:11:04,218 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 206 [2018-09-26 08:11:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:04,219 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:11:04,219 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:11:04,220 INFO L605 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-09-26 08:11:04,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:11:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-09-26 08:11:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:11:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-09-26 08:11:04,223 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2018-09-26 08:11:04,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:04,223 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-09-26 08:11:04,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:11:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-09-26 08:11:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:11:04,225 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:04,225 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1, 1, 1] [2018-09-26 08:11:04,225 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:04,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:04,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2023427879, now seen corresponding path program 101 times [2018-09-26 08:11:04,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:04,537 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:04,537 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:11:04,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:11:04,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:11:04,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:11:04,539 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 104 states. [2018-09-26 08:11:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:04,719 INFO L93 Difference]: Finished difference Result 215 states and 217 transitions. [2018-09-26 08:11:04,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:11:04,719 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 208 [2018-09-26 08:11:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:04,720 INFO L225 Difference]: With dead ends: 215 [2018-09-26 08:11:04,720 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:11:04,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:11:04,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:11:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-26 08:11:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:11:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-09-26 08:11:04,726 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-09-26 08:11:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:04,727 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-09-26 08:11:04,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:11:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-09-26 08:11:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:11:04,728 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:04,728 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1, 1, 1] [2018-09-26 08:11:04,728 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:04,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:04,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1189551581, now seen corresponding path program 102 times [2018-09-26 08:11:04,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:05,121 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:05,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:11:05,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:11:05,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:11:05,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:11:05,123 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 105 states. [2018-09-26 08:11:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:05,364 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-09-26 08:11:05,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:11:05,365 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 210 [2018-09-26 08:11:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:05,366 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:11:05,366 INFO L226 Difference]: Without dead ends: 213 [2018-09-26 08:11:05,367 INFO L605 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-09-26 08:11:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-26 08:11:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-09-26 08:11:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 08:11:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-09-26 08:11:05,374 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-09-26 08:11:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:05,375 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-09-26 08:11:05,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:11:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-09-26 08:11:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:11:05,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:05,376 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1, 1, 1] [2018-09-26 08:11:05,377 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:05,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:05,377 INFO L82 PathProgramCache]: Analyzing trace with hash -781326817, now seen corresponding path program 103 times [2018-09-26 08:11:05,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:05,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:05,974 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:11:05,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:11:05,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:11:05,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:11:05,979 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 106 states. [2018-09-26 08:11:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:06,140 INFO L93 Difference]: Finished difference Result 219 states and 221 transitions. [2018-09-26 08:11:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:11:06,140 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 212 [2018-09-26 08:11:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:06,141 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:11:06,141 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:11:06,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:11:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:11:06,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-09-26 08:11:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:11:06,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-09-26 08:11:06,146 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2018-09-26 08:11:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:06,147 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-09-26 08:11:06,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:11:06,147 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-09-26 08:11:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:11:06,148 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:06,148 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1, 1, 1] [2018-09-26 08:11:06,148 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:06,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:06,149 INFO L82 PathProgramCache]: Analyzing trace with hash 680647451, now seen corresponding path program 104 times [2018-09-26 08:11:06,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:06,560 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:06,560 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:11:06,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:11:06,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:11:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:11:06,562 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 107 states. [2018-09-26 08:11:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:06,793 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2018-09-26 08:11:06,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:11:06,793 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 214 [2018-09-26 08:11:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:06,794 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:11:06,794 INFO L226 Difference]: Without dead ends: 217 [2018-09-26 08:11:06,795 INFO L605 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-09-26 08:11:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-26 08:11:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-09-26 08:11:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 08:11:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-09-26 08:11:06,800 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 214 [2018-09-26 08:11:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:06,801 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-09-26 08:11:06,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:11:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-09-26 08:11:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:11:06,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:06,802 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1, 1, 1] [2018-09-26 08:11:06,802 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:06,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:06,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1183613207, now seen corresponding path program 105 times [2018-09-26 08:11:06,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:07,271 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:07,272 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:11:07,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:11:07,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:11:07,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:11:07,274 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 108 states. [2018-09-26 08:11:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:07,452 INFO L93 Difference]: Finished difference Result 223 states and 225 transitions. [2018-09-26 08:11:07,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:11:07,452 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 216 [2018-09-26 08:11:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:07,453 INFO L225 Difference]: With dead ends: 223 [2018-09-26 08:11:07,454 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:11:07,454 INFO L605 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-09-26 08:11:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:11:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-09-26 08:11:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:11:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-09-26 08:11:07,460 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2018-09-26 08:11:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:07,460 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-09-26 08:11:07,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:11:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-09-26 08:11:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:11:07,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:07,461 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1, 1, 1] [2018-09-26 08:11:07,462 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:07,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:07,462 INFO L82 PathProgramCache]: Analyzing trace with hash -797599725, now seen corresponding path program 106 times [2018-09-26 08:11:07,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:07,920 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:07,920 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:11:07,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:11:07,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:11:07,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:11:07,922 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 109 states. [2018-09-26 08:11:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:08,142 INFO L93 Difference]: Finished difference Result 225 states and 227 transitions. [2018-09-26 08:11:08,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:11:08,142 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 218 [2018-09-26 08:11:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:08,143 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:11:08,143 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 08:11:08,144 INFO L605 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-09-26 08:11:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 08:11:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-09-26 08:11:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:11:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-09-26 08:11:08,149 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 218 [2018-09-26 08:11:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:08,149 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-09-26 08:11:08,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:11:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-09-26 08:11:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:11:08,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:08,151 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1, 1, 1] [2018-09-26 08:11:08,151 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:08,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:08,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2072715249, now seen corresponding path program 107 times [2018-09-26 08:11:08,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:08,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:08,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:11:08,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:11:08,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:11:08,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:11:08,535 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 110 states. [2018-09-26 08:11:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:08,827 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-09-26 08:11:08,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:11:08,827 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 220 [2018-09-26 08:11:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:08,828 INFO L225 Difference]: With dead ends: 227 [2018-09-26 08:11:08,828 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:11:08,829 INFO L605 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-09-26 08:11:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:11:08,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-09-26 08:11:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:11:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-09-26 08:11:08,834 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 220 [2018-09-26 08:11:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:08,834 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-09-26 08:11:08,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:11:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-09-26 08:11:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:11:08,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:08,835 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1, 1, 1] [2018-09-26 08:11:08,836 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:08,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:08,836 INFO L82 PathProgramCache]: Analyzing trace with hash 901912843, now seen corresponding path program 108 times [2018-09-26 08:11:08,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:09,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:09,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:11:09,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:11:09,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:11:09,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:11:09,280 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 111 states. [2018-09-26 08:11:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:09,547 INFO L93 Difference]: Finished difference Result 229 states and 231 transitions. [2018-09-26 08:11:09,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:11:09,548 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 222 [2018-09-26 08:11:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:09,548 INFO L225 Difference]: With dead ends: 229 [2018-09-26 08:11:09,548 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:11:09,550 INFO L605 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-09-26 08:11:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:11:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-26 08:11:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:11:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-09-26 08:11:09,554 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 222 [2018-09-26 08:11:09,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:09,555 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-09-26 08:11:09,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:11:09,555 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-09-26 08:11:09,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:11:09,556 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:09,556 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1, 1, 1] [2018-09-26 08:11:09,556 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:09,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:09,557 INFO L82 PathProgramCache]: Analyzing trace with hash -928709881, now seen corresponding path program 109 times [2018-09-26 08:11:09,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:09,958 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:09,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:11:09,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:11:09,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:11:09,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:11:09,961 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 112 states. [2018-09-26 08:11:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:10,255 INFO L93 Difference]: Finished difference Result 231 states and 233 transitions. [2018-09-26 08:11:10,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:11:10,255 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 224 [2018-09-26 08:11:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:10,256 INFO L225 Difference]: With dead ends: 231 [2018-09-26 08:11:10,256 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:11:10,257 INFO L605 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-09-26 08:11:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:11:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-26 08:11:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:11:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-09-26 08:11:10,263 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 224 [2018-09-26 08:11:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:10,263 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-09-26 08:11:10,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:11:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-09-26 08:11:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:11:10,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:10,264 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1, 1, 1] [2018-09-26 08:11:10,264 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:10,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:10,265 INFO L82 PathProgramCache]: Analyzing trace with hash 779443715, now seen corresponding path program 110 times [2018-09-26 08:11:10,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:10,870 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:10,870 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:11:10,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:11:10,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:11:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:11:10,872 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 113 states. [2018-09-26 08:11:11,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:11,135 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2018-09-26 08:11:11,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:11:11,136 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 226 [2018-09-26 08:11:11,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:11,136 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:11:11,136 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:11:11,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:11:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:11:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-09-26 08:11:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 08:11:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-09-26 08:11:11,140 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 226 [2018-09-26 08:11:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:11,140 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-09-26 08:11:11,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:11:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-09-26 08:11:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:11:11,141 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:11,141 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1, 1, 1] [2018-09-26 08:11:11,141 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:11,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:11,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1637542399, now seen corresponding path program 111 times [2018-09-26 08:11:11,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:11,519 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:11,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:11:11,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:11:11,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:11:11,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:11:11,522 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 114 states. [2018-09-26 08:11:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:11,802 INFO L93 Difference]: Finished difference Result 235 states and 237 transitions. [2018-09-26 08:11:11,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:11:11,803 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 228 [2018-09-26 08:11:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:11,803 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:11:11,803 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:11:11,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:11:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:11:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-09-26 08:11:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:11:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-09-26 08:11:11,809 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 228 [2018-09-26 08:11:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:11,809 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-09-26 08:11:11,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:11:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-09-26 08:11:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:11:11,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:11,811 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1, 1, 1] [2018-09-26 08:11:11,811 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:11,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:11,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1636656891, now seen corresponding path program 112 times [2018-09-26 08:11:11,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:12,205 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:12,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:11:12,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:11:12,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:11:12,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:11:12,207 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 115 states. [2018-09-26 08:11:12,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:12,451 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-09-26 08:11:12,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:11:12,452 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 230 [2018-09-26 08:11:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:12,452 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:11:12,452 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:11:12,453 INFO L605 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-09-26 08:11:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:11:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-09-26 08:11:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:11:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-09-26 08:11:12,456 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 230 [2018-09-26 08:11:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:12,456 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-09-26 08:11:12,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:11:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-09-26 08:11:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:11:12,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:12,457 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1, 1, 1] [2018-09-26 08:11:12,458 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:12,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash 785683703, now seen corresponding path program 113 times [2018-09-26 08:11:12,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:13,007 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:13,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:11:13,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:11:13,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:11:13,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:11:13,010 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 116 states. [2018-09-26 08:11:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:13,223 INFO L93 Difference]: Finished difference Result 239 states and 241 transitions. [2018-09-26 08:11:13,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:11:13,223 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 232 [2018-09-26 08:11:13,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:13,224 INFO L225 Difference]: With dead ends: 239 [2018-09-26 08:11:13,224 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:11:13,225 INFO L605 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-09-26 08:11:13,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:11:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 08:11:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:11:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-09-26 08:11:13,230 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 232 [2018-09-26 08:11:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:13,231 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-09-26 08:11:13,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:11:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-09-26 08:11:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:11:13,232 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:13,232 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1, 1, 1] [2018-09-26 08:11:13,232 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:13,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:13,233 INFO L82 PathProgramCache]: Analyzing trace with hash -955763725, now seen corresponding path program 114 times [2018-09-26 08:11:13,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:13,692 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:13,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:11:13,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:11:13,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:11:13,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:11:13,695 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 117 states. [2018-09-26 08:11:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:13,961 INFO L93 Difference]: Finished difference Result 241 states and 243 transitions. [2018-09-26 08:11:13,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:11:13,961 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 234 [2018-09-26 08:11:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:13,962 INFO L225 Difference]: With dead ends: 241 [2018-09-26 08:11:13,962 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 08:11:13,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:11:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 08:11:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-26 08:11:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 08:11:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-09-26 08:11:13,969 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 234 [2018-09-26 08:11:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:13,969 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-09-26 08:11:13,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:11:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-09-26 08:11:13,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 08:11:13,970 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:13,970 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1, 1, 1] [2018-09-26 08:11:13,971 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:13,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:13,972 INFO L82 PathProgramCache]: Analyzing trace with hash 550503407, now seen corresponding path program 115 times [2018-09-26 08:11:13,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:14,603 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:14,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:11:14,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:11:14,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:11:14,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:11:14,605 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 118 states. [2018-09-26 08:11:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:14,774 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2018-09-26 08:11:14,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:11:14,775 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 236 [2018-09-26 08:11:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:14,775 INFO L225 Difference]: With dead ends: 243 [2018-09-26 08:11:14,775 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:11:14,776 INFO L605 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-09-26 08:11:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:11:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-26 08:11:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 08:11:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-09-26 08:11:14,781 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 236 [2018-09-26 08:11:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:14,781 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-09-26 08:11:14,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:11:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-09-26 08:11:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:11:14,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:14,782 INFO L375 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1, 1, 1] [2018-09-26 08:11:14,783 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:14,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:14,783 INFO L82 PathProgramCache]: Analyzing trace with hash 669238507, now seen corresponding path program 116 times [2018-09-26 08:11:14,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:15,243 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:15,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:11:15,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:11:15,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:11:15,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:11:15,244 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 119 states. [2018-09-26 08:11:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:15,408 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2018-09-26 08:11:15,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:11:15,409 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 238 [2018-09-26 08:11:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:15,409 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:11:15,409 INFO L226 Difference]: Without dead ends: 241 [2018-09-26 08:11:15,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:11:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-09-26 08:11:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-09-26 08:11:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 08:11:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-09-26 08:11:15,414 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 238 [2018-09-26 08:11:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:15,415 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-09-26 08:11:15,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:11:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-09-26 08:11:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 08:11:15,416 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:15,416 INFO L375 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1, 1, 1] [2018-09-26 08:11:15,416 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:15,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:15,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1190447385, now seen corresponding path program 117 times [2018-09-26 08:11:15,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:15,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:15,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:11:15,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:11:15,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:11:15,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:11:15,877 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 120 states. [2018-09-26 08:11:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:16,199 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-09-26 08:11:16,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:11:16,199 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 240 [2018-09-26 08:11:16,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:16,199 INFO L225 Difference]: With dead ends: 247 [2018-09-26 08:11:16,200 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:11:16,200 INFO L605 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-09-26 08:11:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:11:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-09-26 08:11:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 08:11:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-09-26 08:11:16,203 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 240 [2018-09-26 08:11:16,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:16,204 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-09-26 08:11:16,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:11:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-09-26 08:11:16,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-26 08:11:16,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:16,205 INFO L375 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1, 1, 1] [2018-09-26 08:11:16,205 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:16,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:16,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1642194461, now seen corresponding path program 118 times [2018-09-26 08:11:16,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:16,654 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:16,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:11:16,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:11:16,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:11:16,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:11:16,656 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 121 states. [2018-09-26 08:11:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:16,930 INFO L93 Difference]: Finished difference Result 249 states and 251 transitions. [2018-09-26 08:11:16,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:11:16,931 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 242 [2018-09-26 08:11:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:16,931 INFO L225 Difference]: With dead ends: 249 [2018-09-26 08:11:16,931 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 08:11:16,932 INFO L605 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-09-26 08:11:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 08:11:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-09-26 08:11:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:11:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-09-26 08:11:16,937 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 242 [2018-09-26 08:11:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:16,937 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-09-26 08:11:16,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:11:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-09-26 08:11:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:11:16,938 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:16,939 INFO L375 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1, 1, 1] [2018-09-26 08:11:16,939 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:16,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1979437601, now seen corresponding path program 119 times [2018-09-26 08:11:16,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:17,625 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:17,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:11:17,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:11:17,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:11:17,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:11:17,627 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 122 states. [2018-09-26 08:11:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:17,734 INFO L93 Difference]: Finished difference Result 251 states and 253 transitions. [2018-09-26 08:11:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:11:17,734 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 244 [2018-09-26 08:11:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:17,735 INFO L225 Difference]: With dead ends: 251 [2018-09-26 08:11:17,735 INFO L226 Difference]: Without dead ends: 247 [2018-09-26 08:11:17,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:11:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-09-26 08:11:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-09-26 08:11:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-26 08:11:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-09-26 08:11:17,741 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 244 [2018-09-26 08:11:17,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:17,742 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-09-26 08:11:17,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:11:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-09-26 08:11:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-26 08:11:17,743 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:17,743 INFO L375 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1, 1, 1] [2018-09-26 08:11:17,743 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:17,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:17,744 INFO L82 PathProgramCache]: Analyzing trace with hash 347419355, now seen corresponding path program 120 times [2018-09-26 08:11:17,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:18,277 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:18,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:11:18,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:11:18,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:11:18,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:11:18,279 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 123 states. [2018-09-26 08:11:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:18,615 INFO L93 Difference]: Finished difference Result 253 states and 255 transitions. [2018-09-26 08:11:18,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:11:18,615 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 246 [2018-09-26 08:11:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:18,616 INFO L225 Difference]: With dead ends: 253 [2018-09-26 08:11:18,616 INFO L226 Difference]: Without dead ends: 249 [2018-09-26 08:11:18,617 INFO L605 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-09-26 08:11:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-26 08:11:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-09-26 08:11:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-26 08:11:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-09-26 08:11:18,621 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 246 [2018-09-26 08:11:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:18,622 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-09-26 08:11:18,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:11:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-09-26 08:11:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-26 08:11:18,623 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:18,623 INFO L375 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1, 1, 1] [2018-09-26 08:11:18,623 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:18,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1221007145, now seen corresponding path program 121 times [2018-09-26 08:11:18,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:19,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:19,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:11:19,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:11:19,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:11:19,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:11:19,149 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 124 states. [2018-09-26 08:11:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:19,494 INFO L93 Difference]: Finished difference Result 255 states and 257 transitions. [2018-09-26 08:11:19,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:11:19,495 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 248 [2018-09-26 08:11:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:19,495 INFO L225 Difference]: With dead ends: 255 [2018-09-26 08:11:19,495 INFO L226 Difference]: Without dead ends: 251 [2018-09-26 08:11:19,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:11:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-09-26 08:11:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-09-26 08:11:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:11:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-09-26 08:11:19,499 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 248 [2018-09-26 08:11:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:19,500 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-09-26 08:11:19,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:11:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-09-26 08:11:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:11:19,501 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:19,501 INFO L375 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1, 1, 1] [2018-09-26 08:11:19,501 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:19,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:19,501 INFO L82 PathProgramCache]: Analyzing trace with hash -945352749, now seen corresponding path program 122 times [2018-09-26 08:11:19,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:20,087 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:20,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:11:20,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:11:20,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:11:20,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:11:20,090 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 125 states. [2018-09-26 08:11:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:20,406 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-09-26 08:11:20,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:11:20,406 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 250 [2018-09-26 08:11:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:20,407 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:11:20,407 INFO L226 Difference]: Without dead ends: 253 [2018-09-26 08:11:20,408 INFO L605 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-09-26 08:11:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-09-26 08:11:20,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-09-26 08:11:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-26 08:11:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-09-26 08:11:20,411 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 250 [2018-09-26 08:11:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:20,411 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-09-26 08:11:20,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:11:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-09-26 08:11:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-26 08:11:20,412 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:20,412 INFO L375 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1, 1, 1] [2018-09-26 08:11:20,413 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:20,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1965516751, now seen corresponding path program 123 times [2018-09-26 08:11:20,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:20,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:20,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:11:20,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:11:20,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:11:20,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:11:20,907 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 126 states. [2018-09-26 08:11:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:21,235 INFO L93 Difference]: Finished difference Result 259 states and 261 transitions. [2018-09-26 08:11:21,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:11:21,236 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 252 [2018-09-26 08:11:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:21,236 INFO L225 Difference]: With dead ends: 259 [2018-09-26 08:11:21,236 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 08:11:21,237 INFO L605 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-09-26 08:11:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 08:11:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-09-26 08:11:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 08:11:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-09-26 08:11:21,240 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 252 [2018-09-26 08:11:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:21,241 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-09-26 08:11:21,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:11:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-09-26 08:11:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-26 08:11:21,242 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:21,242 INFO L375 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1, 1, 1] [2018-09-26 08:11:21,242 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:21,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:21,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1007570741, now seen corresponding path program 124 times [2018-09-26 08:11:21,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:21,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:21,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:11:21,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:11:21,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:11:21,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:11:21,897 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 127 states. [2018-09-26 08:11:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:22,228 INFO L93 Difference]: Finished difference Result 261 states and 263 transitions. [2018-09-26 08:11:22,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:11:22,228 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 254 [2018-09-26 08:11:22,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:22,229 INFO L225 Difference]: With dead ends: 261 [2018-09-26 08:11:22,229 INFO L226 Difference]: Without dead ends: 257 [2018-09-26 08:11:22,230 INFO L605 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-09-26 08:11:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-09-26 08:11:22,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-09-26 08:11:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 08:11:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-09-26 08:11:22,236 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 254 [2018-09-26 08:11:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:22,236 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-09-26 08:11:22,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:11:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-09-26 08:11:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 08:11:22,238 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:22,238 INFO L375 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1, 1, 1] [2018-09-26 08:11:22,239 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:22,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:22,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1991398713, now seen corresponding path program 125 times [2018-09-26 08:11:22,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:22,794 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:22,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:11:22,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:11:22,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:11:22,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:11:22,796 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 128 states. [2018-09-26 08:11:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:23,178 INFO L93 Difference]: Finished difference Result 263 states and 265 transitions. [2018-09-26 08:11:23,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:11:23,178 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 256 [2018-09-26 08:11:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:23,179 INFO L225 Difference]: With dead ends: 263 [2018-09-26 08:11:23,179 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 08:11:23,180 INFO L605 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-09-26 08:11:23,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 08:11:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-09-26 08:11:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-26 08:11:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-09-26 08:11:23,183 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 256 [2018-09-26 08:11:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:23,183 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-09-26 08:11:23,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:11:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-09-26 08:11:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-26 08:11:23,184 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:23,185 INFO L375 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1, 1, 1] [2018-09-26 08:11:23,185 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:23,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:23,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1737692611, now seen corresponding path program 126 times [2018-09-26 08:11:23,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:23,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:23,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:11:23,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:11:23,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:11:23,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:11:23,716 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 129 states. [2018-09-26 08:11:24,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:24,132 INFO L93 Difference]: Finished difference Result 265 states and 267 transitions. [2018-09-26 08:11:24,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:11:24,133 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 258 [2018-09-26 08:11:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:24,134 INFO L225 Difference]: With dead ends: 265 [2018-09-26 08:11:24,134 INFO L226 Difference]: Without dead ends: 261 [2018-09-26 08:11:24,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:11:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-09-26 08:11:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-09-26 08:11:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-26 08:11:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-09-26 08:11:24,138 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 258 [2018-09-26 08:11:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:24,138 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-09-26 08:11:24,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:11:24,138 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-09-26 08:11:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-26 08:11:24,139 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:24,139 INFO L375 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1, 1, 1] [2018-09-26 08:11:24,139 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:24,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash -903237185, now seen corresponding path program 127 times [2018-09-26 08:11:24,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:24,922 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:24,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:11:24,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:11:24,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:11:24,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:11:24,931 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 130 states. [2018-09-26 08:11:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:25,158 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2018-09-26 08:11:25,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:11:25,158 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 260 [2018-09-26 08:11:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:25,159 INFO L225 Difference]: With dead ends: 267 [2018-09-26 08:11:25,160 INFO L226 Difference]: Without dead ends: 263 [2018-09-26 08:11:25,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:11:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-09-26 08:11:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-09-26 08:11:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-09-26 08:11:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-09-26 08:11:25,165 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 260 [2018-09-26 08:11:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,165 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-09-26 08:11:25,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:11:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-09-26 08:11:25,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-26 08:11:25,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,167 INFO L375 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1, 1, 1] [2018-09-26 08:11:25,167 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,167 INFO L82 PathProgramCache]: Analyzing trace with hash -511099205, now seen corresponding path program 128 times [2018-09-26 08:11:25,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:25,736 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:11:25,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:11:25,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:11:25,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:11:25,740 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 131 states. [2018-09-26 08:11:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,083 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2018-09-26 08:11:26,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:11:26,083 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 262 [2018-09-26 08:11:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,084 INFO L225 Difference]: With dead ends: 269 [2018-09-26 08:11:26,084 INFO L226 Difference]: Without dead ends: 265 [2018-09-26 08:11:26,085 INFO L605 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-09-26 08:11:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-26 08:11:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-09-26 08:11:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-26 08:11:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-09-26 08:11:26,090 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 262 [2018-09-26 08:11:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,090 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-09-26 08:11:26,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:11:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-09-26 08:11:26,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-26 08:11:26,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,092 INFO L375 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1, 1, 1] [2018-09-26 08:11:26,092 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1623622473, now seen corresponding path program 129 times [2018-09-26 08:11:26,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:26,667 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:11:26,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:11:26,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:11:26,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:11:26,670 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 132 states. [2018-09-26 08:11:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,119 INFO L93 Difference]: Finished difference Result 271 states and 273 transitions. [2018-09-26 08:11:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:11:27,119 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 264 [2018-09-26 08:11:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,119 INFO L225 Difference]: With dead ends: 271 [2018-09-26 08:11:27,119 INFO L226 Difference]: Without dead ends: 267 [2018-09-26 08:11:27,120 INFO L605 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-09-26 08:11:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-09-26 08:11:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-09-26 08:11:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:11:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-09-26 08:11:27,123 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 264 [2018-09-26 08:11:27,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,124 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-09-26 08:11:27,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:11:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-09-26 08:11:27,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-26 08:11:27,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,124 INFO L375 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1, 1, 1] [2018-09-26 08:11:27,125 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1311626317, now seen corresponding path program 130 times [2018-09-26 08:11:27,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:27,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:27,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:11:27,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:11:27,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:11:27,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:11:27,664 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 133 states. [2018-09-26 08:11:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,808 INFO L93 Difference]: Finished difference Result 273 states and 275 transitions. [2018-09-26 08:11:27,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:11:27,809 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 266 [2018-09-26 08:11:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,809 INFO L225 Difference]: With dead ends: 273 [2018-09-26 08:11:27,810 INFO L226 Difference]: Without dead ends: 269 [2018-09-26 08:11:27,811 INFO L605 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-09-26 08:11:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-26 08:11:27,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-09-26 08:11:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-26 08:11:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-09-26 08:11:27,814 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 266 [2018-09-26 08:11:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,814 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-09-26 08:11:27,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:11:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-09-26 08:11:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-26 08:11:27,815 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,815 INFO L375 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1, 1, 1] [2018-09-26 08:11:27,815 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2131031121, now seen corresponding path program 131 times [2018-09-26 08:11:27,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:28,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:28,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:11:28,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:11:28,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:11:28,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:11:28,418 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 134 states. [2018-09-26 08:11:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:28,886 INFO L93 Difference]: Finished difference Result 275 states and 277 transitions. [2018-09-26 08:11:28,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:11:28,886 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 268 [2018-09-26 08:11:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:28,887 INFO L225 Difference]: With dead ends: 275 [2018-09-26 08:11:28,887 INFO L226 Difference]: Without dead ends: 271 [2018-09-26 08:11:28,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:11:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-09-26 08:11:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-09-26 08:11:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-26 08:11:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-09-26 08:11:28,890 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 268 [2018-09-26 08:11:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:28,891 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-09-26 08:11:28,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:11:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-09-26 08:11:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-26 08:11:28,892 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:28,892 INFO L375 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1, 1, 1] [2018-09-26 08:11:28,892 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:28,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:28,892 INFO L82 PathProgramCache]: Analyzing trace with hash 694934699, now seen corresponding path program 132 times [2018-09-26 08:11:28,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:29,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:29,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:11:29,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:11:29,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:11:29,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:11:29,485 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 135 states. [2018-09-26 08:11:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:29,881 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2018-09-26 08:11:29,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:11:29,881 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 270 [2018-09-26 08:11:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:29,882 INFO L225 Difference]: With dead ends: 277 [2018-09-26 08:11:29,882 INFO L226 Difference]: Without dead ends: 273 [2018-09-26 08:11:29,883 INFO L605 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-09-26 08:11:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-09-26 08:11:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-09-26 08:11:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-26 08:11:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-09-26 08:11:29,887 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 270 [2018-09-26 08:11:29,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:29,888 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-09-26 08:11:29,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:11:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-09-26 08:11:29,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-26 08:11:29,889 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:29,889 INFO L375 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1, 1, 1] [2018-09-26 08:11:29,889 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:29,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:29,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2028756647, now seen corresponding path program 133 times [2018-09-26 08:11:29,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:30,559 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:30,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:11:30,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:11:30,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:11:30,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:11:30,562 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 136 states. [2018-09-26 08:11:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:31,105 INFO L93 Difference]: Finished difference Result 279 states and 281 transitions. [2018-09-26 08:11:31,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:11:31,105 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 272 [2018-09-26 08:11:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:31,106 INFO L225 Difference]: With dead ends: 279 [2018-09-26 08:11:31,106 INFO L226 Difference]: Without dead ends: 275 [2018-09-26 08:11:31,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:11:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-26 08:11:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-09-26 08:11:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-26 08:11:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-09-26 08:11:31,110 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 272 [2018-09-26 08:11:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:31,110 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-09-26 08:11:31,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:11:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-09-26 08:11:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-26 08:11:31,111 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:31,111 INFO L375 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1, 1, 1] [2018-09-26 08:11:31,111 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:31,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:31,112 INFO L82 PathProgramCache]: Analyzing trace with hash -363572829, now seen corresponding path program 134 times [2018-09-26 08:11:31,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:31,728 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:31,728 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:11:31,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:11:31,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:11:31,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:11:31,731 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 137 states. [2018-09-26 08:11:32,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:32,199 INFO L93 Difference]: Finished difference Result 281 states and 283 transitions. [2018-09-26 08:11:32,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:11:32,199 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 274 [2018-09-26 08:11:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:32,200 INFO L225 Difference]: With dead ends: 281 [2018-09-26 08:11:32,200 INFO L226 Difference]: Without dead ends: 277 [2018-09-26 08:11:32,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:11:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-09-26 08:11:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-09-26 08:11:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-26 08:11:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-09-26 08:11:32,204 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 274 [2018-09-26 08:11:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:32,205 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-09-26 08:11:32,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:11:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-09-26 08:11:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-26 08:11:32,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:32,206 INFO L375 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1, 1, 1] [2018-09-26 08:11:32,206 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:32,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1584695905, now seen corresponding path program 135 times [2018-09-26 08:11:32,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:32,855 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:32,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:11:32,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:11:32,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:11:32,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:11:32,857 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 138 states. [2018-09-26 08:11:33,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:33,167 INFO L93 Difference]: Finished difference Result 283 states and 285 transitions. [2018-09-26 08:11:33,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:11:33,168 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 276 [2018-09-26 08:11:33,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:33,168 INFO L225 Difference]: With dead ends: 283 [2018-09-26 08:11:33,168 INFO L226 Difference]: Without dead ends: 279 [2018-09-26 08:11:33,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:11:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-26 08:11:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-09-26 08:11:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-09-26 08:11:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-09-26 08:11:33,175 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 276 [2018-09-26 08:11:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:33,175 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-09-26 08:11:33,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:11:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-09-26 08:11:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-09-26 08:11:33,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:33,176 INFO L375 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1, 1, 1] [2018-09-26 08:11:33,177 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:33,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:33,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1737067163, now seen corresponding path program 136 times [2018-09-26 08:11:33,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:33,877 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:33,877 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-09-26 08:11:33,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-09-26 08:11:33,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-09-26 08:11:33,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:11:33,879 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 139 states. [2018-09-26 08:11:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:34,093 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions. [2018-09-26 08:11:34,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:11:34,094 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 278 [2018-09-26 08:11:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:34,094 INFO L225 Difference]: With dead ends: 285 [2018-09-26 08:11:34,094 INFO L226 Difference]: Without dead ends: 281 [2018-09-26 08:11:34,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:11:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-09-26 08:11:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-09-26 08:11:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 08:11:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-09-26 08:11:34,099 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 278 [2018-09-26 08:11:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:34,100 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-09-26 08:11:34,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-09-26 08:11:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-09-26 08:11:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 08:11:34,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:34,101 INFO L375 BasicCegarLoop]: trace histogram [138, 137, 1, 1, 1, 1, 1] [2018-09-26 08:11:34,101 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:34,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:34,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1504292713, now seen corresponding path program 137 times [2018-09-26 08:11:34,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:34,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:34,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:11:34,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:11:34,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:11:34,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:11:34,725 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 140 states. [2018-09-26 08:11:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:34,912 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2018-09-26 08:11:34,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:11:34,912 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 280 [2018-09-26 08:11:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:34,913 INFO L225 Difference]: With dead ends: 287 [2018-09-26 08:11:34,913 INFO L226 Difference]: Without dead ends: 283 [2018-09-26 08:11:34,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:11:34,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-09-26 08:11:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-09-26 08:11:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-09-26 08:11:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-09-26 08:11:34,919 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 280 [2018-09-26 08:11:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:34,919 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-09-26 08:11:34,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:11:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-09-26 08:11:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-26 08:11:34,920 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:34,921 INFO L375 BasicCegarLoop]: trace histogram [139, 138, 1, 1, 1, 1, 1] [2018-09-26 08:11:34,921 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:34,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:34,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1695123347, now seen corresponding path program 138 times [2018-09-26 08:11:34,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:35,634 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:35,634 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:11:35,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:11:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:11:35,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:11:35,637 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 141 states. [2018-09-26 08:11:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:35,832 INFO L93 Difference]: Finished difference Result 289 states and 291 transitions. [2018-09-26 08:11:35,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:11:35,832 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 282 [2018-09-26 08:11:35,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:35,833 INFO L225 Difference]: With dead ends: 289 [2018-09-26 08:11:35,833 INFO L226 Difference]: Without dead ends: 285 [2018-09-26 08:11:35,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:11:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-09-26 08:11:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-09-26 08:11:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-26 08:11:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-09-26 08:11:35,837 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 282 [2018-09-26 08:11:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:35,837 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-09-26 08:11:35,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:11:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-09-26 08:11:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-26 08:11:35,838 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:35,838 INFO L375 BasicCegarLoop]: trace histogram [140, 139, 1, 1, 1, 1, 1] [2018-09-26 08:11:35,839 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:35,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:35,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1137373071, now seen corresponding path program 139 times [2018-09-26 08:11:35,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:36,464 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:36,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:11:36,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:11:36,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:11:36,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:11:36,468 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 142 states. [2018-09-26 08:11:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:36,704 INFO L93 Difference]: Finished difference Result 291 states and 293 transitions. [2018-09-26 08:11:36,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:11:36,704 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 284 [2018-09-26 08:11:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:36,705 INFO L225 Difference]: With dead ends: 291 [2018-09-26 08:11:36,705 INFO L226 Difference]: Without dead ends: 287 [2018-09-26 08:11:36,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:11:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-09-26 08:11:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-09-26 08:11:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-09-26 08:11:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-09-26 08:11:36,710 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 284 [2018-09-26 08:11:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:36,710 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-09-26 08:11:36,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:11:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-09-26 08:11:36,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-26 08:11:36,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:36,712 INFO L375 BasicCegarLoop]: trace histogram [141, 140, 1, 1, 1, 1, 1] [2018-09-26 08:11:36,712 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:36,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:36,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2010269835, now seen corresponding path program 140 times [2018-09-26 08:11:36,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:37,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:37,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-09-26 08:11:37,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-26 08:11:37,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-26 08:11:37,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:11:37,406 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 143 states. [2018-09-26 08:11:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:37,799 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2018-09-26 08:11:37,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:11:37,799 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 286 [2018-09-26 08:11:37,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:37,800 INFO L225 Difference]: With dead ends: 293 [2018-09-26 08:11:37,800 INFO L226 Difference]: Without dead ends: 289 [2018-09-26 08:11:37,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:11:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-26 08:11:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-09-26 08:11:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-26 08:11:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-09-26 08:11:37,805 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 286 [2018-09-26 08:11:37,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:37,805 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-09-26 08:11:37,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-26 08:11:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-09-26 08:11:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-26 08:11:37,806 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:37,806 INFO L375 BasicCegarLoop]: trace histogram [142, 141, 1, 1, 1, 1, 1] [2018-09-26 08:11:37,806 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:37,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:37,806 INFO L82 PathProgramCache]: Analyzing trace with hash -949529977, now seen corresponding path program 141 times [2018-09-26 08:11:37,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:38,507 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:38,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:11:38,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:11:38,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:11:38,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:11:38,510 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 144 states. [2018-09-26 08:11:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:39,207 INFO L93 Difference]: Finished difference Result 295 states and 297 transitions. [2018-09-26 08:11:39,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:11:39,207 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 288 [2018-09-26 08:11:39,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:39,208 INFO L225 Difference]: With dead ends: 295 [2018-09-26 08:11:39,208 INFO L226 Difference]: Without dead ends: 291 [2018-09-26 08:11:39,209 INFO L605 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-09-26 08:11:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-26 08:11:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-09-26 08:11:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-26 08:11:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-09-26 08:11:39,212 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 288 [2018-09-26 08:11:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:39,212 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-09-26 08:11:39,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:11:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-09-26 08:11:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-26 08:11:39,213 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:39,213 INFO L375 BasicCegarLoop]: trace histogram [143, 142, 1, 1, 1, 1, 1] [2018-09-26 08:11:39,213 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:39,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:39,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2048799357, now seen corresponding path program 142 times [2018-09-26 08:11:39,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:39,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:39,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:11:39,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:11:39,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:11:39,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:11:39,936 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 145 states. [2018-09-26 08:11:40,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:40,620 INFO L93 Difference]: Finished difference Result 297 states and 299 transitions. [2018-09-26 08:11:40,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:11:40,620 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 290 [2018-09-26 08:11:40,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:40,621 INFO L225 Difference]: With dead ends: 297 [2018-09-26 08:11:40,621 INFO L226 Difference]: Without dead ends: 293 [2018-09-26 08:11:40,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:11:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-09-26 08:11:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-09-26 08:11:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-26 08:11:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 294 transitions. [2018-09-26 08:11:40,626 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 294 transitions. Word has length 290 [2018-09-26 08:11:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:40,626 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 294 transitions. [2018-09-26 08:11:40,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:11:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 294 transitions. [2018-09-26 08:11:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-26 08:11:40,627 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:40,627 INFO L375 BasicCegarLoop]: trace histogram [144, 143, 1, 1, 1, 1, 1] [2018-09-26 08:11:40,627 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:40,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:40,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1884718721, now seen corresponding path program 143 times [2018-09-26 08:11:40,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:41,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:41,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:11:41,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:11:41,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:11:41,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:11:41,371 INFO L87 Difference]: Start difference. First operand 293 states and 294 transitions. Second operand 146 states. [2018-09-26 08:11:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:41,976 INFO L93 Difference]: Finished difference Result 299 states and 301 transitions. [2018-09-26 08:11:41,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:11:41,976 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 292 [2018-09-26 08:11:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:41,977 INFO L225 Difference]: With dead ends: 299 [2018-09-26 08:11:41,977 INFO L226 Difference]: Without dead ends: 295 [2018-09-26 08:11:41,978 INFO L605 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-09-26 08:11:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-09-26 08:11:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-09-26 08:11:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-09-26 08:11:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-09-26 08:11:41,982 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 292 [2018-09-26 08:11:41,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:41,982 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-09-26 08:11:41,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:11:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-09-26 08:11:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-09-26 08:11:41,983 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:41,984 INFO L375 BasicCegarLoop]: trace histogram [145, 144, 1, 1, 1, 1, 1] [2018-09-26 08:11:41,984 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:41,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:41,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1177949819, now seen corresponding path program 144 times [2018-09-26 08:11:41,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:42,721 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:42,721 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-09-26 08:11:42,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-09-26 08:11:42,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-09-26 08:11:42,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:11:42,723 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 147 states. [2018-09-26 08:11:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:43,281 INFO L93 Difference]: Finished difference Result 301 states and 303 transitions. [2018-09-26 08:11:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:11:43,282 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 294 [2018-09-26 08:11:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:43,282 INFO L225 Difference]: With dead ends: 301 [2018-09-26 08:11:43,283 INFO L226 Difference]: Without dead ends: 297 [2018-09-26 08:11:43,283 INFO L605 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-09-26 08:11:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-09-26 08:11:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-09-26 08:11:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-26 08:11:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-09-26 08:11:43,286 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 294 [2018-09-26 08:11:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:43,287 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-09-26 08:11:43,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-09-26 08:11:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-09-26 08:11:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-26 08:11:43,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:43,288 INFO L375 BasicCegarLoop]: trace histogram [146, 145, 1, 1, 1, 1, 1] [2018-09-26 08:11:43,288 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:43,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:43,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1945148297, now seen corresponding path program 145 times [2018-09-26 08:11:43,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:43,959 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:43,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:11:43,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:11:43,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:11:43,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:11:43,962 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 148 states. [2018-09-26 08:11:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:44,231 INFO L93 Difference]: Finished difference Result 303 states and 305 transitions. [2018-09-26 08:11:44,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:11:44,231 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 296 [2018-09-26 08:11:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:44,232 INFO L225 Difference]: With dead ends: 303 [2018-09-26 08:11:44,232 INFO L226 Difference]: Without dead ends: 299 [2018-09-26 08:11:44,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:11:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-26 08:11:44,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-09-26 08:11:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-09-26 08:11:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-09-26 08:11:44,236 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 296 [2018-09-26 08:11:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:44,236 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-09-26 08:11:44,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:11:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-09-26 08:11:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-09-26 08:11:44,237 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:44,237 INFO L375 BasicCegarLoop]: trace histogram [147, 146, 1, 1, 1, 1, 1] [2018-09-26 08:11:44,238 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:44,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1060297869, now seen corresponding path program 146 times [2018-09-26 08:11:44,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:44,978 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:44,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:11:44,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:11:44,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:11:44,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:11:44,981 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 149 states. [2018-09-26 08:11:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:45,704 INFO L93 Difference]: Finished difference Result 305 states and 307 transitions. [2018-09-26 08:11:45,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:11:45,705 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 298 [2018-09-26 08:11:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:45,705 INFO L225 Difference]: With dead ends: 305 [2018-09-26 08:11:45,706 INFO L226 Difference]: Without dead ends: 301 [2018-09-26 08:11:45,707 INFO L605 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-09-26 08:11:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-26 08:11:45,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-26 08:11:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 08:11:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-09-26 08:11:45,712 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 298 [2018-09-26 08:11:45,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:45,712 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-09-26 08:11:45,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:11:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-09-26 08:11:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-26 08:11:45,714 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:45,714 INFO L375 BasicCegarLoop]: trace histogram [148, 147, 1, 1, 1, 1, 1] [2018-09-26 08:11:45,714 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:45,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:45,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1122561169, now seen corresponding path program 147 times [2018-09-26 08:11:45,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:46,501 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:11:46,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:11:46,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:11:46,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:11:46,504 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 150 states. [2018-09-26 08:11:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:47,116 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-09-26 08:11:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:11:47,117 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 300 [2018-09-26 08:11:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:47,117 INFO L225 Difference]: With dead ends: 307 [2018-09-26 08:11:47,117 INFO L226 Difference]: Without dead ends: 303 [2018-09-26 08:11:47,118 INFO L605 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-09-26 08:11:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-09-26 08:11:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-09-26 08:11:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-09-26 08:11:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-09-26 08:11:47,121 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 300 [2018-09-26 08:11:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:47,121 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-09-26 08:11:47,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:11:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-09-26 08:11:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-09-26 08:11:47,122 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:47,122 INFO L375 BasicCegarLoop]: trace histogram [149, 148, 1, 1, 1, 1, 1] [2018-09-26 08:11:47,122 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:47,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:47,122 INFO L82 PathProgramCache]: Analyzing trace with hash -828050325, now seen corresponding path program 148 times [2018-09-26 08:11:47,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:47,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:47,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-09-26 08:11:47,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-26 08:11:47,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-26 08:11:47,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:11:47,825 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 151 states. [2018-09-26 08:11:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,041 INFO L93 Difference]: Finished difference Result 309 states and 311 transitions. [2018-09-26 08:11:48,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:11:48,041 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 302 [2018-09-26 08:11:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,042 INFO L225 Difference]: With dead ends: 309 [2018-09-26 08:11:48,042 INFO L226 Difference]: Without dead ends: 305 [2018-09-26 08:11:48,044 INFO L605 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-09-26 08:11:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-09-26 08:11:48,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-09-26 08:11:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-26 08:11:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-09-26 08:11:48,049 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 302 [2018-09-26 08:11:48,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,049 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-09-26 08:11:48,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-26 08:11:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-09-26 08:11:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-26 08:11:48,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,051 INFO L375 BasicCegarLoop]: trace histogram [150, 149, 1, 1, 1, 1, 1] [2018-09-26 08:11:48,051 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1270970777, now seen corresponding path program 149 times [2018-09-26 08:11:48,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:48,893 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:48,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:11:48,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:11:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:11:48,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:11:48,897 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 152 states. [2018-09-26 08:11:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:49,704 INFO L93 Difference]: Finished difference Result 311 states and 313 transitions. [2018-09-26 08:11:49,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:11:49,704 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 304 [2018-09-26 08:11:49,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:49,705 INFO L225 Difference]: With dead ends: 311 [2018-09-26 08:11:49,705 INFO L226 Difference]: Without dead ends: 307 [2018-09-26 08:11:49,706 INFO L605 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-09-26 08:11:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-09-26 08:11:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-09-26 08:11:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-26 08:11:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-09-26 08:11:49,709 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 304 [2018-09-26 08:11:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:49,710 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-09-26 08:11:49,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:11:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-09-26 08:11:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-09-26 08:11:49,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:49,711 INFO L375 BasicCegarLoop]: trace histogram [151, 150, 1, 1, 1, 1, 1] [2018-09-26 08:11:49,711 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:49,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1715762845, now seen corresponding path program 150 times [2018-09-26 08:11:49,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:50,436 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:50,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-09-26 08:11:50,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-09-26 08:11:50,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-09-26 08:11:50,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:11:50,439 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 153 states. [2018-09-26 08:11:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:51,032 INFO L93 Difference]: Finished difference Result 313 states and 315 transitions. [2018-09-26 08:11:51,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:11:51,032 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 306 [2018-09-26 08:11:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:51,033 INFO L225 Difference]: With dead ends: 313 [2018-09-26 08:11:51,033 INFO L226 Difference]: Without dead ends: 309 [2018-09-26 08:11:51,035 INFO L605 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-09-26 08:11:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-26 08:11:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-09-26 08:11:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-26 08:11:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-09-26 08:11:51,038 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 306 [2018-09-26 08:11:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:51,039 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-09-26 08:11:51,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-09-26 08:11:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-09-26 08:11:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-26 08:11:51,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:51,040 INFO L375 BasicCegarLoop]: trace histogram [152, 151, 1, 1, 1, 1, 1] [2018-09-26 08:11:51,040 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:51,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash 335789407, now seen corresponding path program 151 times [2018-09-26 08:11:51,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:51,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:51,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:11:51,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:11:51,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:11:51,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:11:51,795 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 154 states. [2018-09-26 08:11:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:52,527 INFO L93 Difference]: Finished difference Result 315 states and 317 transitions. [2018-09-26 08:11:52,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:11:52,527 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 308 [2018-09-26 08:11:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:52,528 INFO L225 Difference]: With dead ends: 315 [2018-09-26 08:11:52,528 INFO L226 Difference]: Without dead ends: 311 [2018-09-26 08:11:52,529 INFO L605 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-09-26 08:11:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-09-26 08:11:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-09-26 08:11:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-09-26 08:11:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-09-26 08:11:52,534 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 308 [2018-09-26 08:11:52,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:52,534 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-09-26 08:11:52,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:11:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-09-26 08:11:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-26 08:11:52,536 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:52,536 INFO L375 BasicCegarLoop]: trace histogram [153, 152, 1, 1, 1, 1, 1] [2018-09-26 08:11:52,536 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:52,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash 487514715, now seen corresponding path program 152 times [2018-09-26 08:11:52,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:53,394 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:53,394 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-09-26 08:11:53,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-09-26 08:11:53,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-09-26 08:11:53,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:11:53,397 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 155 states. [2018-09-26 08:11:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:54,135 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2018-09-26 08:11:54,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:11:54,135 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 310 [2018-09-26 08:11:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:54,136 INFO L225 Difference]: With dead ends: 317 [2018-09-26 08:11:54,136 INFO L226 Difference]: Without dead ends: 313 [2018-09-26 08:11:54,137 INFO L605 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-09-26 08:11:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-09-26 08:11:54,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-09-26 08:11:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-09-26 08:11:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-09-26 08:11:54,140 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 310 [2018-09-26 08:11:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:54,140 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-09-26 08:11:54,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-09-26 08:11:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-09-26 08:11:54,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-09-26 08:11:54,141 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:54,141 INFO L375 BasicCegarLoop]: trace histogram [154, 153, 1, 1, 1, 1, 1] [2018-09-26 08:11:54,142 INFO L423 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:54,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:54,142 INFO L82 PathProgramCache]: Analyzing trace with hash 266647639, now seen corresponding path program 153 times [2018-09-26 08:11:54,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:54,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:54,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:11:54,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:11:54,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:11:54,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:11:54,942 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 156 states. [2018-09-26 08:11:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:55,749 INFO L93 Difference]: Finished difference Result 319 states and 321 transitions. [2018-09-26 08:11:55,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:11:55,749 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 312 [2018-09-26 08:11:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:55,750 INFO L225 Difference]: With dead ends: 319 [2018-09-26 08:11:55,750 INFO L226 Difference]: Without dead ends: 315 [2018-09-26 08:11:55,752 INFO L605 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-09-26 08:11:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-09-26 08:11:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-09-26 08:11:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-26 08:11:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-09-26 08:11:55,755 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 312 [2018-09-26 08:11:55,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:55,756 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-09-26 08:11:55,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:11:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-09-26 08:11:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-09-26 08:11:55,757 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:55,757 INFO L375 BasicCegarLoop]: trace histogram [155, 154, 1, 1, 1, 1, 1] [2018-09-26 08:11:55,757 INFO L423 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:55,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:55,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1533214893, now seen corresponding path program 154 times [2018-09-26 08:11:55,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:56,553 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:56,553 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-09-26 08:11:56,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-09-26 08:11:56,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-09-26 08:11:56,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:11:56,557 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 157 states. [2018-09-26 08:11:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:57,043 INFO L93 Difference]: Finished difference Result 321 states and 323 transitions. [2018-09-26 08:11:57,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:11:57,043 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 314 [2018-09-26 08:11:57,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:57,043 INFO L225 Difference]: With dead ends: 321 [2018-09-26 08:11:57,043 INFO L226 Difference]: Without dead ends: 317 [2018-09-26 08:11:57,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:11:57,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-09-26 08:11:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-09-26 08:11:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-09-26 08:11:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 318 transitions. [2018-09-26 08:11:57,048 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 318 transitions. Word has length 314 [2018-09-26 08:11:57,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:57,048 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 318 transitions. [2018-09-26 08:11:57,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-09-26 08:11:57,048 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 318 transitions. [2018-09-26 08:11:57,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-09-26 08:11:57,049 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:57,049 INFO L375 BasicCegarLoop]: trace histogram [156, 155, 1, 1, 1, 1, 1] [2018-09-26 08:11:57,049 INFO L423 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:57,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash -329287857, now seen corresponding path program 155 times [2018-09-26 08:11:57,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:57,848 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:57,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-09-26 08:11:57,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-09-26 08:11:57,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-09-26 08:11:57,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:11:57,851 INFO L87 Difference]: Start difference. First operand 317 states and 318 transitions. Second operand 158 states. [2018-09-26 08:11:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:58,775 INFO L93 Difference]: Finished difference Result 323 states and 325 transitions. [2018-09-26 08:11:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:11:58,775 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 316 [2018-09-26 08:11:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:58,776 INFO L225 Difference]: With dead ends: 323 [2018-09-26 08:11:58,776 INFO L226 Difference]: Without dead ends: 319 [2018-09-26 08:11:58,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:11:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-09-26 08:11:58,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-09-26 08:11:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-26 08:11:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-09-26 08:11:58,781 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 316 [2018-09-26 08:11:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:58,781 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-09-26 08:11:58,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-09-26 08:11:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-09-26 08:11:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-09-26 08:11:58,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:58,783 INFO L375 BasicCegarLoop]: trace histogram [157, 156, 1, 1, 1, 1, 1] [2018-09-26 08:11:58,783 INFO L423 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:58,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1298391115, now seen corresponding path program 156 times [2018-09-26 08:11:58,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:59,633 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:59,634 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-09-26 08:11:59,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-09-26 08:11:59,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-09-26 08:11:59,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:11:59,636 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 159 states. [2018-09-26 08:12:00,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:00,023 INFO L93 Difference]: Finished difference Result 325 states and 327 transitions. [2018-09-26 08:12:00,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:12:00,023 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 318 [2018-09-26 08:12:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:00,023 INFO L225 Difference]: With dead ends: 325 [2018-09-26 08:12:00,023 INFO L226 Difference]: Without dead ends: 321 [2018-09-26 08:12:00,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:12:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-09-26 08:12:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-09-26 08:12:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-09-26 08:12:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-09-26 08:12:00,027 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 318 [2018-09-26 08:12:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:00,028 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-09-26 08:12:00,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-09-26 08:12:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-09-26 08:12:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-09-26 08:12:00,029 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:00,029 INFO L375 BasicCegarLoop]: trace histogram [158, 157, 1, 1, 1, 1, 1] [2018-09-26 08:12:00,029 INFO L423 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:00,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:00,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2129787463, now seen corresponding path program 157 times [2018-09-26 08:12:00,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:00,851 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:00,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:12:00,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:12:00,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:12:00,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:12:00,854 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 160 states. [2018-09-26 08:12:01,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:01,675 INFO L93 Difference]: Finished difference Result 327 states and 329 transitions. [2018-09-26 08:12:01,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:12:01,675 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 320 [2018-09-26 08:12:01,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:01,676 INFO L225 Difference]: With dead ends: 327 [2018-09-26 08:12:01,676 INFO L226 Difference]: Without dead ends: 323 [2018-09-26 08:12:01,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:12:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-09-26 08:12:01,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-09-26 08:12:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-09-26 08:12:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 324 transitions. [2018-09-26 08:12:01,682 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 324 transitions. Word has length 320 [2018-09-26 08:12:01,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:01,682 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 324 transitions. [2018-09-26 08:12:01,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:12:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 324 transitions. [2018-09-26 08:12:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-09-26 08:12:01,684 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:01,684 INFO L375 BasicCegarLoop]: trace histogram [159, 158, 1, 1, 1, 1, 1] [2018-09-26 08:12:01,684 INFO L423 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:01,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:01,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2057206461, now seen corresponding path program 158 times [2018-09-26 08:12:01,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:02,635 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:02,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-09-26 08:12:02,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-09-26 08:12:02,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-09-26 08:12:02,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:12:02,638 INFO L87 Difference]: Start difference. First operand 323 states and 324 transitions. Second operand 161 states. [2018-09-26 08:12:03,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:03,645 INFO L93 Difference]: Finished difference Result 329 states and 331 transitions. [2018-09-26 08:12:03,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:12:03,645 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 322 [2018-09-26 08:12:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:03,645 INFO L225 Difference]: With dead ends: 329 [2018-09-26 08:12:03,645 INFO L226 Difference]: Without dead ends: 325 [2018-09-26 08:12:03,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:12:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-09-26 08:12:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-09-26 08:12:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-09-26 08:12:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-09-26 08:12:03,651 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 322 [2018-09-26 08:12:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:03,652 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-09-26 08:12:03,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-09-26 08:12:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-09-26 08:12:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-09-26 08:12:03,653 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:03,653 INFO L375 BasicCegarLoop]: trace histogram [160, 159, 1, 1, 1, 1, 1] [2018-09-26 08:12:03,653 INFO L423 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:03,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:03,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1374011073, now seen corresponding path program 159 times [2018-09-26 08:12:03,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:04,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:04,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-09-26 08:12:04,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-09-26 08:12:04,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-09-26 08:12:04,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:12:04,545 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 162 states. [2018-09-26 08:12:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:05,189 INFO L93 Difference]: Finished difference Result 331 states and 333 transitions. [2018-09-26 08:12:05,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:12:05,189 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 324 [2018-09-26 08:12:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:05,190 INFO L225 Difference]: With dead ends: 331 [2018-09-26 08:12:05,190 INFO L226 Difference]: Without dead ends: 327 [2018-09-26 08:12:05,190 INFO L605 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-09-26 08:12:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-09-26 08:12:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-09-26 08:12:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-09-26 08:12:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-09-26 08:12:05,194 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 324 [2018-09-26 08:12:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:05,194 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-09-26 08:12:05,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-09-26 08:12:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-09-26 08:12:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-09-26 08:12:05,195 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:05,195 INFO L375 BasicCegarLoop]: trace histogram [161, 160, 1, 1, 1, 1, 1] [2018-09-26 08:12:05,195 INFO L423 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:05,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:05,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1953239493, now seen corresponding path program 160 times [2018-09-26 08:12:05,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:06,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:06,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-09-26 08:12:06,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-09-26 08:12:06,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-09-26 08:12:06,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:12:06,068 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 163 states. [2018-09-26 08:12:06,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:06,354 INFO L93 Difference]: Finished difference Result 333 states and 335 transitions. [2018-09-26 08:12:06,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:12:06,355 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 326 [2018-09-26 08:12:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:06,355 INFO L225 Difference]: With dead ends: 333 [2018-09-26 08:12:06,355 INFO L226 Difference]: Without dead ends: 329 [2018-09-26 08:12:06,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:12:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-09-26 08:12:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-09-26 08:12:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-09-26 08:12:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-09-26 08:12:06,360 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 326 [2018-09-26 08:12:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:06,360 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-09-26 08:12:06,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-09-26 08:12:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-09-26 08:12:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-09-26 08:12:06,361 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:06,361 INFO L375 BasicCegarLoop]: trace histogram [162, 161, 1, 1, 1, 1, 1] [2018-09-26 08:12:06,361 INFO L423 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:06,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash -246002633, now seen corresponding path program 161 times [2018-09-26 08:12:06,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:07,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:07,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:12:07,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:12:07,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:12:07,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:12:07,255 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 164 states. [2018-09-26 08:12:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:07,999 INFO L93 Difference]: Finished difference Result 335 states and 337 transitions. [2018-09-26 08:12:07,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:12:07,999 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 328 [2018-09-26 08:12:08,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:08,000 INFO L225 Difference]: With dead ends: 335 [2018-09-26 08:12:08,000 INFO L226 Difference]: Without dead ends: 331 [2018-09-26 08:12:08,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:12:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-09-26 08:12:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-09-26 08:12:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-09-26 08:12:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-09-26 08:12:08,004 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 328 [2018-09-26 08:12:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:08,005 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-09-26 08:12:08,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:12:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-09-26 08:12:08,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-09-26 08:12:08,005 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:08,006 INFO L375 BasicCegarLoop]: trace histogram [163, 162, 1, 1, 1, 1, 1] [2018-09-26 08:12:08,006 INFO L423 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:08,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:08,006 INFO L82 PathProgramCache]: Analyzing trace with hash -268887245, now seen corresponding path program 162 times [2018-09-26 08:12:08,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:08,910 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:08,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-09-26 08:12:08,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-09-26 08:12:08,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-09-26 08:12:08,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:12:08,913 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 165 states. [2018-09-26 08:12:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:09,889 INFO L93 Difference]: Finished difference Result 337 states and 339 transitions. [2018-09-26 08:12:09,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:12:09,889 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 330 [2018-09-26 08:12:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:09,889 INFO L225 Difference]: With dead ends: 337 [2018-09-26 08:12:09,889 INFO L226 Difference]: Without dead ends: 333 [2018-09-26 08:12:09,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:12:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-09-26 08:12:09,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-09-26 08:12:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-09-26 08:12:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 334 transitions. [2018-09-26 08:12:09,894 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 334 transitions. Word has length 330 [2018-09-26 08:12:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:09,894 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 334 transitions. [2018-09-26 08:12:09,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-09-26 08:12:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 334 transitions. [2018-09-26 08:12:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-09-26 08:12:09,895 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:09,895 INFO L375 BasicCegarLoop]: trace histogram [164, 163, 1, 1, 1, 1, 1] [2018-09-26 08:12:09,895 INFO L423 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:09,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:09,895 INFO L82 PathProgramCache]: Analyzing trace with hash -786162897, now seen corresponding path program 163 times [2018-09-26 08:12:09,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:10,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:10,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-09-26 08:12:10,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-09-26 08:12:10,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-09-26 08:12:10,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:12:10,787 INFO L87 Difference]: Start difference. First operand 333 states and 334 transitions. Second operand 166 states. [2018-09-26 08:12:11,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:11,876 INFO L93 Difference]: Finished difference Result 339 states and 341 transitions. [2018-09-26 08:12:11,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:12:11,876 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 332 [2018-09-26 08:12:11,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:11,877 INFO L225 Difference]: With dead ends: 339 [2018-09-26 08:12:11,877 INFO L226 Difference]: Without dead ends: 335 [2018-09-26 08:12:11,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:12:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-09-26 08:12:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-09-26 08:12:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-09-26 08:12:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-09-26 08:12:11,882 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 332 [2018-09-26 08:12:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:11,882 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-09-26 08:12:11,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-09-26 08:12:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-09-26 08:12:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-09-26 08:12:11,883 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:11,883 INFO L375 BasicCegarLoop]: trace histogram [165, 164, 1, 1, 1, 1, 1] [2018-09-26 08:12:11,883 INFO L423 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:11,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:11,883 INFO L82 PathProgramCache]: Analyzing trace with hash 328141867, now seen corresponding path program 164 times [2018-09-26 08:12:11,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:12,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:12,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-09-26 08:12:12,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-09-26 08:12:12,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-09-26 08:12:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:12:12,824 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 167 states. [2018-09-26 08:12:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:13,969 INFO L93 Difference]: Finished difference Result 341 states and 343 transitions. [2018-09-26 08:12:13,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:12:13,970 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 334 [2018-09-26 08:12:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:13,970 INFO L225 Difference]: With dead ends: 341 [2018-09-26 08:12:13,970 INFO L226 Difference]: Without dead ends: 337 [2018-09-26 08:12:13,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:12:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-09-26 08:12:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-09-26 08:12:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-26 08:12:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-09-26 08:12:13,974 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 334 [2018-09-26 08:12:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:13,975 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-09-26 08:12:13,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-09-26 08:12:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-09-26 08:12:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-09-26 08:12:13,976 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:13,976 INFO L375 BasicCegarLoop]: trace histogram [166, 165, 1, 1, 1, 1, 1] [2018-09-26 08:12:13,976 INFO L423 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:13,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1728163367, now seen corresponding path program 165 times [2018-09-26 08:12:13,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:14,899 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:14,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:12:14,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:12:14,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:12:14,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:12:14,902 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 168 states. [2018-09-26 08:12:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:16,084 INFO L93 Difference]: Finished difference Result 343 states and 345 transitions. [2018-09-26 08:12:16,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:12:16,084 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 336 [2018-09-26 08:12:16,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:16,085 INFO L225 Difference]: With dead ends: 343 [2018-09-26 08:12:16,085 INFO L226 Difference]: Without dead ends: 339 [2018-09-26 08:12:16,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:12:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-09-26 08:12:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-09-26 08:12:16,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-26 08:12:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-09-26 08:12:16,091 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 336 [2018-09-26 08:12:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:16,091 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-09-26 08:12:16,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-09-26 08:12:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-09-26 08:12:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-09-26 08:12:16,093 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:16,093 INFO L375 BasicCegarLoop]: trace histogram [167, 166, 1, 1, 1, 1, 1] [2018-09-26 08:12:16,093 INFO L423 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:16,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:16,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1470906077, now seen corresponding path program 166 times [2018-09-26 08:12:16,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:17,249 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:17,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-09-26 08:12:17,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-09-26 08:12:17,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-09-26 08:12:17,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:12:17,253 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 169 states. [2018-09-26 08:12:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:18,462 INFO L93 Difference]: Finished difference Result 345 states and 347 transitions. [2018-09-26 08:12:18,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:12:18,462 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 338 [2018-09-26 08:12:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:18,463 INFO L225 Difference]: With dead ends: 345 [2018-09-26 08:12:18,463 INFO L226 Difference]: Without dead ends: 341 [2018-09-26 08:12:18,464 INFO L605 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-09-26 08:12:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-09-26 08:12:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-09-26 08:12:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-26 08:12:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 342 transitions. [2018-09-26 08:12:18,467 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 342 transitions. Word has length 338 [2018-09-26 08:12:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:18,468 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 342 transitions. [2018-09-26 08:12:18,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-09-26 08:12:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 342 transitions. [2018-09-26 08:12:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-09-26 08:12:18,469 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:18,469 INFO L375 BasicCegarLoop]: trace histogram [168, 167, 1, 1, 1, 1, 1] [2018-09-26 08:12:18,469 INFO L423 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:18,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:18,469 INFO L82 PathProgramCache]: Analyzing trace with hash -580057825, now seen corresponding path program 167 times [2018-09-26 08:12:18,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:19,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:19,492 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-09-26 08:12:19,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-09-26 08:12:19,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-09-26 08:12:19,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:12:19,495 INFO L87 Difference]: Start difference. First operand 341 states and 342 transitions. Second operand 170 states. [2018-09-26 08:12:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:20,720 INFO L93 Difference]: Finished difference Result 347 states and 349 transitions. [2018-09-26 08:12:20,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:12:20,720 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 340 [2018-09-26 08:12:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:20,721 INFO L225 Difference]: With dead ends: 347 [2018-09-26 08:12:20,721 INFO L226 Difference]: Without dead ends: 343 [2018-09-26 08:12:20,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:12:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-26 08:12:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-09-26 08:12:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-26 08:12:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-09-26 08:12:20,725 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 340 [2018-09-26 08:12:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:20,726 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-09-26 08:12:20,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-09-26 08:12:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-09-26 08:12:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-09-26 08:12:20,727 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:20,727 INFO L375 BasicCegarLoop]: trace histogram [169, 168, 1, 1, 1, 1, 1] [2018-09-26 08:12:20,727 INFO L423 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:20,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:20,727 INFO L82 PathProgramCache]: Analyzing trace with hash 826620443, now seen corresponding path program 168 times [2018-09-26 08:12:20,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:21,706 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:21,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-09-26 08:12:21,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-09-26 08:12:21,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-09-26 08:12:21,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:12:21,710 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 171 states. [2018-09-26 08:12:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:22,993 INFO L93 Difference]: Finished difference Result 349 states and 351 transitions. [2018-09-26 08:12:22,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:12:22,993 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 342 [2018-09-26 08:12:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:22,993 INFO L225 Difference]: With dead ends: 349 [2018-09-26 08:12:22,993 INFO L226 Difference]: Without dead ends: 345 [2018-09-26 08:12:22,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:12:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-09-26 08:12:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-09-26 08:12:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-09-26 08:12:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-09-26 08:12:22,998 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 342 [2018-09-26 08:12:22,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:22,998 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-09-26 08:12:22,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-09-26 08:12:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-09-26 08:12:23,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-09-26 08:12:23,000 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:23,000 INFO L375 BasicCegarLoop]: trace histogram [170, 169, 1, 1, 1, 1, 1] [2018-09-26 08:12:23,000 INFO L423 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:23,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:23,000 INFO L82 PathProgramCache]: Analyzing trace with hash -270262249, now seen corresponding path program 169 times [2018-09-26 08:12:23,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:24,046 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:24,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-09-26 08:12:24,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-09-26 08:12:24,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-09-26 08:12:24,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:12:24,048 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 172 states. [2018-09-26 08:12:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:25,220 INFO L93 Difference]: Finished difference Result 351 states and 353 transitions. [2018-09-26 08:12:25,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:12:25,220 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 344 [2018-09-26 08:12:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:25,220 INFO L225 Difference]: With dead ends: 351 [2018-09-26 08:12:25,220 INFO L226 Difference]: Without dead ends: 347 [2018-09-26 08:12:25,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:12:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-09-26 08:12:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-09-26 08:12:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-09-26 08:12:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-09-26 08:12:25,224 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 344 [2018-09-26 08:12:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:25,225 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-09-26 08:12:25,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-09-26 08:12:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-09-26 08:12:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-09-26 08:12:25,226 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:25,226 INFO L375 BasicCegarLoop]: trace histogram [171, 170, 1, 1, 1, 1, 1] [2018-09-26 08:12:25,226 INFO L423 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:25,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:25,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2107541741, now seen corresponding path program 170 times [2018-09-26 08:12:25,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:26,270 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:26,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-09-26 08:12:26,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-09-26 08:12:26,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-09-26 08:12:26,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:12:26,275 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 173 states. [2018-09-26 08:12:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:27,447 INFO L93 Difference]: Finished difference Result 353 states and 355 transitions. [2018-09-26 08:12:27,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:12:27,447 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 346 [2018-09-26 08:12:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:27,448 INFO L225 Difference]: With dead ends: 353 [2018-09-26 08:12:27,448 INFO L226 Difference]: Without dead ends: 349 [2018-09-26 08:12:27,450 INFO L605 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-09-26 08:12:27,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-26 08:12:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-09-26 08:12:27,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-26 08:12:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-09-26 08:12:27,454 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 346 [2018-09-26 08:12:27,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:27,454 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-09-26 08:12:27,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-09-26 08:12:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-09-26 08:12:27,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-09-26 08:12:27,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:27,456 INFO L375 BasicCegarLoop]: trace histogram [172, 171, 1, 1, 1, 1, 1] [2018-09-26 08:12:27,456 INFO L423 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:27,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:27,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1793392399, now seen corresponding path program 171 times [2018-09-26 08:12:27,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:28,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:28,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-09-26 08:12:28,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-09-26 08:12:28,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-09-26 08:12:28,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:12:28,495 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 174 states. [2018-09-26 08:12:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:29,214 INFO L93 Difference]: Finished difference Result 355 states and 357 transitions. [2018-09-26 08:12:29,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:12:29,215 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 348 [2018-09-26 08:12:29,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:29,215 INFO L225 Difference]: With dead ends: 355 [2018-09-26 08:12:29,215 INFO L226 Difference]: Without dead ends: 351 [2018-09-26 08:12:29,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:12:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-26 08:12:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-09-26 08:12:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-09-26 08:12:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-09-26 08:12:29,220 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 348 [2018-09-26 08:12:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:29,221 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-09-26 08:12:29,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-09-26 08:12:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-09-26 08:12:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-09-26 08:12:29,222 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:29,222 INFO L375 BasicCegarLoop]: trace histogram [173, 172, 1, 1, 1, 1, 1] [2018-09-26 08:12:29,222 INFO L423 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:29,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1084651531, now seen corresponding path program 172 times [2018-09-26 08:12:29,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 29756 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:30,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:30,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-09-26 08:12:30,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-09-26 08:12:30,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-09-26 08:12:30,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:12:30,225 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 175 states. [2018-09-26 08:12:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:30,591 INFO L93 Difference]: Finished difference Result 357 states and 359 transitions. [2018-09-26 08:12:30,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-26 08:12:30,591 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 350 [2018-09-26 08:12:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:30,592 INFO L225 Difference]: With dead ends: 357 [2018-09-26 08:12:30,592 INFO L226 Difference]: Without dead ends: 353 [2018-09-26 08:12:30,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:12:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-09-26 08:12:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-09-26 08:12:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-09-26 08:12:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 354 transitions. [2018-09-26 08:12:30,597 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 354 transitions. Word has length 350 [2018-09-26 08:12:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:30,598 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 354 transitions. [2018-09-26 08:12:30,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-09-26 08:12:30,598 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 354 transitions. [2018-09-26 08:12:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-09-26 08:12:30,599 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:30,599 INFO L375 BasicCegarLoop]: trace histogram [174, 173, 1, 1, 1, 1, 1] [2018-09-26 08:12:30,599 INFO L423 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:30,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:30,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1410489849, now seen corresponding path program 173 times [2018-09-26 08:12:30,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30102 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:31,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:31,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-09-26 08:12:31,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-09-26 08:12:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-09-26 08:12:31,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:12:31,691 INFO L87 Difference]: Start difference. First operand 353 states and 354 transitions. Second operand 176 states. [2018-09-26 08:12:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:32,772 INFO L93 Difference]: Finished difference Result 359 states and 361 transitions. [2018-09-26 08:12:32,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:12:32,772 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 352 [2018-09-26 08:12:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:32,773 INFO L225 Difference]: With dead ends: 359 [2018-09-26 08:12:32,773 INFO L226 Difference]: Without dead ends: 355 [2018-09-26 08:12:32,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:12:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-09-26 08:12:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-09-26 08:12:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-09-26 08:12:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-09-26 08:12:32,780 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 352 [2018-09-26 08:12:32,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:32,781 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-09-26 08:12:32,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-09-26 08:12:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-09-26 08:12:32,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-09-26 08:12:32,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:32,782 INFO L375 BasicCegarLoop]: trace histogram [175, 174, 1, 1, 1, 1, 1] [2018-09-26 08:12:32,783 INFO L423 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:32,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:32,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1645362435, now seen corresponding path program 174 times [2018-09-26 08:12:32,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 30450 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:34,006 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:34,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-09-26 08:12:34,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-09-26 08:12:34,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-09-26 08:12:34,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:12:34,010 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 177 states. [2018-09-26 08:12:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:35,435 INFO L93 Difference]: Finished difference Result 361 states and 363 transitions. [2018-09-26 08:12:35,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-09-26 08:12:35,435 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 354 [2018-09-26 08:12:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:35,436 INFO L225 Difference]: With dead ends: 361 [2018-09-26 08:12:35,436 INFO L226 Difference]: Without dead ends: 357 [2018-09-26 08:12:35,437 INFO L605 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-09-26 08:12:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-09-26 08:12:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-09-26 08:12:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-09-26 08:12:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-09-26 08:12:35,440 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 354 [2018-09-26 08:12:35,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:35,441 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-09-26 08:12:35,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-09-26 08:12:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-09-26 08:12:35,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-09-26 08:12:35,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:35,442 INFO L375 BasicCegarLoop]: trace histogram [176, 175, 1, 1, 1, 1, 1] [2018-09-26 08:12:35,442 INFO L423 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:35,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:35,442 INFO L82 PathProgramCache]: Analyzing trace with hash 561776895, now seen corresponding path program 175 times [2018-09-26 08:12:35,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 30800 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:36,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:36,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-09-26 08:12:36,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-09-26 08:12:36,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-09-26 08:12:36,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:12:36,512 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 178 states. [2018-09-26 08:12:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:37,284 INFO L93 Difference]: Finished difference Result 363 states and 365 transitions. [2018-09-26 08:12:37,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-09-26 08:12:37,284 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 356 [2018-09-26 08:12:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:37,285 INFO L225 Difference]: With dead ends: 363 [2018-09-26 08:12:37,285 INFO L226 Difference]: Without dead ends: 359 [2018-09-26 08:12:37,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:12:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-09-26 08:12:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-09-26 08:12:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-09-26 08:12:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-09-26 08:12:37,290 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 356 [2018-09-26 08:12:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:37,290 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-09-26 08:12:37,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-09-26 08:12:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-09-26 08:12:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-09-26 08:12:37,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:37,291 INFO L375 BasicCegarLoop]: trace histogram [177, 176, 1, 1, 1, 1, 1] [2018-09-26 08:12:37,291 INFO L423 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:37,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1381841413, now seen corresponding path program 176 times [2018-09-26 08:12:37,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 31152 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:38,430 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:38,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-09-26 08:12:38,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-09-26 08:12:38,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-09-26 08:12:38,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:12:38,433 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 179 states. [2018-09-26 08:12:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:39,179 INFO L93 Difference]: Finished difference Result 365 states and 367 transitions. [2018-09-26 08:12:39,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:12:39,180 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 358 [2018-09-26 08:12:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:39,180 INFO L225 Difference]: With dead ends: 365 [2018-09-26 08:12:39,180 INFO L226 Difference]: Without dead ends: 361 [2018-09-26 08:12:39,181 INFO L605 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-09-26 08:12:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-09-26 08:12:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2018-09-26 08:12:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-09-26 08:12:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2018-09-26 08:12:39,184 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 358 [2018-09-26 08:12:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:39,184 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2018-09-26 08:12:39,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-09-26 08:12:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2018-09-26 08:12:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-09-26 08:12:39,185 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:39,185 INFO L375 BasicCegarLoop]: trace histogram [178, 177, 1, 1, 1, 1, 1] [2018-09-26 08:12:39,186 INFO L423 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:39,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:39,186 INFO L82 PathProgramCache]: Analyzing trace with hash -888261641, now seen corresponding path program 177 times [2018-09-26 08:12:39,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 31506 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:40,344 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:40,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-09-26 08:12:40,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-09-26 08:12:40,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-09-26 08:12:40,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:12:40,349 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 180 states. [2018-09-26 08:12:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:41,850 INFO L93 Difference]: Finished difference Result 367 states and 369 transitions. [2018-09-26 08:12:41,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-09-26 08:12:41,851 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 360 [2018-09-26 08:12:41,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:41,851 INFO L225 Difference]: With dead ends: 367 [2018-09-26 08:12:41,851 INFO L226 Difference]: Without dead ends: 363 [2018-09-26 08:12:41,853 INFO L605 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-09-26 08:12:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-09-26 08:12:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-09-26 08:12:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-09-26 08:12:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 364 transitions. [2018-09-26 08:12:41,857 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 364 transitions. Word has length 360 [2018-09-26 08:12:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:41,857 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 364 transitions. [2018-09-26 08:12:41,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-09-26 08:12:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 364 transitions. [2018-09-26 08:12:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-09-26 08:12:41,858 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:41,858 INFO L375 BasicCegarLoop]: trace histogram [179, 178, 1, 1, 1, 1, 1] [2018-09-26 08:12:41,859 INFO L423 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:41,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash 995496691, now seen corresponding path program 178 times [2018-09-26 08:12:41,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 31862 backedges. 0 proven. 31862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:43,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:43,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-09-26 08:12:43,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-09-26 08:12:43,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-09-26 08:12:43,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:12:43,045 INFO L87 Difference]: Start difference. First operand 363 states and 364 transitions. Second operand 181 states. [2018-09-26 08:12:43,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:43,475 INFO L93 Difference]: Finished difference Result 369 states and 371 transitions. [2018-09-26 08:12:43,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-09-26 08:12:43,475 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 362 [2018-09-26 08:12:43,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:43,476 INFO L225 Difference]: With dead ends: 369 [2018-09-26 08:12:43,476 INFO L226 Difference]: Without dead ends: 365 [2018-09-26 08:12:43,477 INFO L605 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-09-26 08:12:43,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-09-26 08:12:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2018-09-26 08:12:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-09-26 08:12:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 366 transitions. [2018-09-26 08:12:43,481 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 366 transitions. Word has length 362 [2018-09-26 08:12:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:43,482 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 366 transitions. [2018-09-26 08:12:43,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-09-26 08:12:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 366 transitions. [2018-09-26 08:12:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-09-26 08:12:43,483 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:43,483 INFO L375 BasicCegarLoop]: trace histogram [180, 179, 1, 1, 1, 1, 1] [2018-09-26 08:12:43,483 INFO L423 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:43,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:43,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1188945169, now seen corresponding path program 179 times [2018-09-26 08:12:43,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 32220 backedges. 0 proven. 32220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:44,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:44,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-09-26 08:12:44,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-09-26 08:12:44,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-09-26 08:12:44,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:12:44,650 INFO L87 Difference]: Start difference. First operand 365 states and 366 transitions. Second operand 182 states. [2018-09-26 08:12:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:46,809 INFO L93 Difference]: Finished difference Result 371 states and 373 transitions. [2018-09-26 08:12:46,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-09-26 08:12:46,810 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 364 [2018-09-26 08:12:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:46,810 INFO L225 Difference]: With dead ends: 371 [2018-09-26 08:12:46,811 INFO L226 Difference]: Without dead ends: 367 [2018-09-26 08:12:46,812 INFO L605 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-09-26 08:12:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-09-26 08:12:46,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-09-26 08:12:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-09-26 08:12:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-09-26 08:12:46,816 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 364 [2018-09-26 08:12:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:46,817 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-09-26 08:12:46,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-09-26 08:12:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-09-26 08:12:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-09-26 08:12:46,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:46,818 INFO L375 BasicCegarLoop]: trace histogram [181, 180, 1, 1, 1, 1, 1] [2018-09-26 08:12:46,818 INFO L423 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:46,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:46,818 INFO L82 PathProgramCache]: Analyzing trace with hash -198564885, now seen corresponding path program 180 times [2018-09-26 08:12:46,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 32580 backedges. 0 proven. 32580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:48,259 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:48,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-09-26 08:12:48,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-09-26 08:12:48,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-09-26 08:12:48,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:12:48,262 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 183 states. [2018-09-26 08:12:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:48,935 INFO L93 Difference]: Finished difference Result 373 states and 375 transitions. [2018-09-26 08:12:48,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-09-26 08:12:48,935 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 366 [2018-09-26 08:12:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:48,936 INFO L225 Difference]: With dead ends: 373 [2018-09-26 08:12:48,936 INFO L226 Difference]: Without dead ends: 369 [2018-09-26 08:12:48,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:12:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-09-26 08:12:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-09-26 08:12:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-09-26 08:12:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-09-26 08:12:48,940 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 366 [2018-09-26 08:12:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:48,940 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-09-26 08:12:48,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-09-26 08:12:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-09-26 08:12:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-09-26 08:12:48,941 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:48,941 INFO L375 BasicCegarLoop]: trace histogram [182, 181, 1, 1, 1, 1, 1] [2018-09-26 08:12:48,941 INFO L423 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:48,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:48,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1925851673, now seen corresponding path program 181 times [2018-09-26 08:12:48,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 32942 backedges. 0 proven. 32942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:50,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:50,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-09-26 08:12:50,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-09-26 08:12:50,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-09-26 08:12:50,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:12:50,137 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 184 states. [2018-09-26 08:12:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:51,995 INFO L93 Difference]: Finished difference Result 375 states and 377 transitions. [2018-09-26 08:12:51,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-09-26 08:12:51,995 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 368 [2018-09-26 08:12:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:51,996 INFO L225 Difference]: With dead ends: 375 [2018-09-26 08:12:51,996 INFO L226 Difference]: Without dead ends: 371 [2018-09-26 08:12:51,997 INFO L605 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-09-26 08:12:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-09-26 08:12:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-09-26 08:12:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-26 08:12:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 372 transitions. [2018-09-26 08:12:52,001 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 372 transitions. Word has length 368 [2018-09-26 08:12:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:52,001 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 372 transitions. [2018-09-26 08:12:52,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-09-26 08:12:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 372 transitions. [2018-09-26 08:12:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-09-26 08:12:52,002 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:52,002 INFO L375 BasicCegarLoop]: trace histogram [183, 182, 1, 1, 1, 1, 1] [2018-09-26 08:12:52,002 INFO L423 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:52,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:52,002 INFO L82 PathProgramCache]: Analyzing trace with hash 303888611, now seen corresponding path program 182 times [2018-09-26 08:12:52,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 33306 backedges. 0 proven. 33306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:53,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:53,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-09-26 08:12:53,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-09-26 08:12:53,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-09-26 08:12:53,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:12:53,237 INFO L87 Difference]: Start difference. First operand 371 states and 372 transitions. Second operand 185 states. [2018-09-26 08:12:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:53,743 INFO L93 Difference]: Finished difference Result 377 states and 379 transitions. [2018-09-26 08:12:53,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-09-26 08:12:53,743 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 370 [2018-09-26 08:12:53,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:53,743 INFO L225 Difference]: With dead ends: 377 [2018-09-26 08:12:53,744 INFO L226 Difference]: Without dead ends: 373 [2018-09-26 08:12:53,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:12:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-09-26 08:12:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-09-26 08:12:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-09-26 08:12:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 374 transitions. [2018-09-26 08:12:53,748 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 374 transitions. Word has length 370 [2018-09-26 08:12:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:53,748 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 374 transitions. [2018-09-26 08:12:53,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-09-26 08:12:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 374 transitions. [2018-09-26 08:12:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-09-26 08:12:53,749 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:53,749 INFO L375 BasicCegarLoop]: trace histogram [184, 183, 1, 1, 1, 1, 1] [2018-09-26 08:12:53,749 INFO L423 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:53,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash -104379169, now seen corresponding path program 183 times [2018-09-26 08:12:53,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 33672 backedges. 0 proven. 33672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:55,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:55,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-09-26 08:12:55,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-09-26 08:12:55,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-09-26 08:12:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:12:55,034 INFO L87 Difference]: Start difference. First operand 373 states and 374 transitions. Second operand 186 states. [2018-09-26 08:12:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:57,185 INFO L93 Difference]: Finished difference Result 379 states and 381 transitions. [2018-09-26 08:12:57,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-09-26 08:12:57,185 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 372 [2018-09-26 08:12:57,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:57,185 INFO L225 Difference]: With dead ends: 379 [2018-09-26 08:12:57,186 INFO L226 Difference]: Without dead ends: 375 [2018-09-26 08:12:57,187 INFO L605 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-09-26 08:12:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-26 08:12:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2018-09-26 08:12:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-09-26 08:12:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2018-09-26 08:12:57,191 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 372 [2018-09-26 08:12:57,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:57,191 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2018-09-26 08:12:57,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-09-26 08:12:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2018-09-26 08:12:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-09-26 08:12:57,192 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:57,192 INFO L375 BasicCegarLoop]: trace histogram [185, 184, 1, 1, 1, 1, 1] [2018-09-26 08:12:57,192 INFO L423 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:57,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:57,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1607691813, now seen corresponding path program 184 times [2018-09-26 08:12:57,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 34040 backedges. 0 proven. 34040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:58,453 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:58,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-09-26 08:12:58,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-09-26 08:12:58,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-09-26 08:12:58,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:12:58,458 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 187 states. [2018-09-26 08:12:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:59,182 INFO L93 Difference]: Finished difference Result 381 states and 383 transitions. [2018-09-26 08:12:59,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-09-26 08:12:59,182 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 374 [2018-09-26 08:12:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:59,182 INFO L225 Difference]: With dead ends: 381 [2018-09-26 08:12:59,182 INFO L226 Difference]: Without dead ends: 377 [2018-09-26 08:12:59,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:12:59,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-09-26 08:12:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-09-26 08:12:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-09-26 08:12:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-09-26 08:12:59,186 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 374 [2018-09-26 08:12:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:59,187 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-09-26 08:12:59,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-09-26 08:12:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-09-26 08:12:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-09-26 08:12:59,188 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:59,188 INFO L375 BasicCegarLoop]: trace histogram [186, 185, 1, 1, 1, 1, 1] [2018-09-26 08:12:59,188 INFO L423 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:59,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:59,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1112836055, now seen corresponding path program 185 times [2018-09-26 08:12:59,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 34410 backedges. 0 proven. 34410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:00,438 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:00,438 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-09-26 08:13:00,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-09-26 08:13:00,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-09-26 08:13:00,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:13:00,442 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 188 states. [2018-09-26 08:13:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:01,482 INFO L93 Difference]: Finished difference Result 383 states and 385 transitions. [2018-09-26 08:13:01,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-09-26 08:13:01,483 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 376 [2018-09-26 08:13:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:01,483 INFO L225 Difference]: With dead ends: 383 [2018-09-26 08:13:01,483 INFO L226 Difference]: Without dead ends: 379 [2018-09-26 08:13:01,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:13:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-09-26 08:13:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-09-26 08:13:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-09-26 08:13:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 380 transitions. [2018-09-26 08:13:01,489 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 380 transitions. Word has length 376 [2018-09-26 08:13:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:01,490 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 380 transitions. [2018-09-26 08:13:01,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-09-26 08:13:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 380 transitions. [2018-09-26 08:13:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-09-26 08:13:01,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:01,492 INFO L375 BasicCegarLoop]: trace histogram [187, 186, 1, 1, 1, 1, 1] [2018-09-26 08:13:01,492 INFO L423 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:01,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:01,492 INFO L82 PathProgramCache]: Analyzing trace with hash -94966061, now seen corresponding path program 186 times [2018-09-26 08:13:01,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 34782 backedges. 0 proven. 34782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:02,839 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:02,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-09-26 08:13:02,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-09-26 08:13:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-09-26 08:13:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:13:02,841 INFO L87 Difference]: Start difference. First operand 379 states and 380 transitions. Second operand 189 states. [2018-09-26 08:13:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:04,602 INFO L93 Difference]: Finished difference Result 385 states and 387 transitions. [2018-09-26 08:13:04,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-09-26 08:13:04,602 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 378 [2018-09-26 08:13:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:04,603 INFO L225 Difference]: With dead ends: 385 [2018-09-26 08:13:04,603 INFO L226 Difference]: Without dead ends: 381 [2018-09-26 08:13:04,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:13:04,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-09-26 08:13:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-09-26 08:13:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-26 08:13:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 382 transitions. [2018-09-26 08:13:04,608 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 382 transitions. Word has length 378 [2018-09-26 08:13:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:04,608 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 382 transitions. [2018-09-26 08:13:04,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-09-26 08:13:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 382 transitions. [2018-09-26 08:13:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-09-26 08:13:04,610 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:04,610 INFO L375 BasicCegarLoop]: trace histogram [188, 187, 1, 1, 1, 1, 1] [2018-09-26 08:13:04,610 INFO L423 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:04,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:04,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1151629617, now seen corresponding path program 187 times [2018-09-26 08:13:04,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 35156 backedges. 0 proven. 35156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:05,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:05,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-09-26 08:13:05,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-09-26 08:13:05,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-09-26 08:13:05,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:13:05,987 INFO L87 Difference]: Start difference. First operand 381 states and 382 transitions. Second operand 190 states. [2018-09-26 08:13:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:07,413 INFO L93 Difference]: Finished difference Result 387 states and 389 transitions. [2018-09-26 08:13:07,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-09-26 08:13:07,413 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 380 [2018-09-26 08:13:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:07,414 INFO L225 Difference]: With dead ends: 387 [2018-09-26 08:13:07,414 INFO L226 Difference]: Without dead ends: 383 [2018-09-26 08:13:07,417 INFO L605 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-09-26 08:13:07,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-09-26 08:13:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-09-26 08:13:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-26 08:13:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-09-26 08:13:07,421 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 380 [2018-09-26 08:13:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:07,421 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-09-26 08:13:07,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-09-26 08:13:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-09-26 08:13:07,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-09-26 08:13:07,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:07,423 INFO L375 BasicCegarLoop]: trace histogram [189, 188, 1, 1, 1, 1, 1] [2018-09-26 08:13:07,423 INFO L423 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:07,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:07,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1301942219, now seen corresponding path program 188 times [2018-09-26 08:13:07,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 35532 backedges. 0 proven. 35532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:09,056 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:09,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-09-26 08:13:09,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-09-26 08:13:09,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-09-26 08:13:09,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:13:09,058 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 191 states. [2018-09-26 08:13:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:09,581 INFO L93 Difference]: Finished difference Result 389 states and 391 transitions. [2018-09-26 08:13:09,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-09-26 08:13:09,581 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 382 [2018-09-26 08:13:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:09,582 INFO L225 Difference]: With dead ends: 389 [2018-09-26 08:13:09,582 INFO L226 Difference]: Without dead ends: 385 [2018-09-26 08:13:09,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:13:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-09-26 08:13:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2018-09-26 08:13:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-09-26 08:13:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-09-26 08:13:09,586 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 382 [2018-09-26 08:13:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:09,587 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-09-26 08:13:09,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-09-26 08:13:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-09-26 08:13:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-09-26 08:13:09,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:09,588 INFO L375 BasicCegarLoop]: trace histogram [190, 189, 1, 1, 1, 1, 1] [2018-09-26 08:13:09,588 INFO L423 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:09,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:09,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1247431111, now seen corresponding path program 189 times [2018-09-26 08:13:09,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 35910 backedges. 0 proven. 35910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:11,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:11,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-09-26 08:13:11,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-09-26 08:13:11,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-09-26 08:13:11,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:13:11,009 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 192 states. [2018-09-26 08:13:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:12,262 INFO L93 Difference]: Finished difference Result 391 states and 393 transitions. [2018-09-26 08:13:12,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-09-26 08:13:12,262 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 384 [2018-09-26 08:13:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:12,263 INFO L225 Difference]: With dead ends: 391 [2018-09-26 08:13:12,263 INFO L226 Difference]: Without dead ends: 387 [2018-09-26 08:13:12,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:13:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-09-26 08:13:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-09-26 08:13:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-26 08:13:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 388 transitions. [2018-09-26 08:13:12,271 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 388 transitions. Word has length 384 [2018-09-26 08:13:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:12,271 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 388 transitions. [2018-09-26 08:13:12,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-09-26 08:13:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 388 transitions. [2018-09-26 08:13:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-09-26 08:13:12,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:12,274 INFO L375 BasicCegarLoop]: trace histogram [191, 190, 1, 1, 1, 1, 1] [2018-09-26 08:13:12,274 INFO L423 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:12,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:12,274 INFO L82 PathProgramCache]: Analyzing trace with hash 401863875, now seen corresponding path program 190 times [2018-09-26 08:13:12,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:13,697 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:13,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-09-26 08:13:13,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-09-26 08:13:13,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-09-26 08:13:13,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:13:13,700 INFO L87 Difference]: Start difference. First operand 387 states and 388 transitions. Second operand 193 states. [2018-09-26 08:13:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:15,562 INFO L93 Difference]: Finished difference Result 393 states and 395 transitions. [2018-09-26 08:13:15,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-09-26 08:13:15,562 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 386 [2018-09-26 08:13:15,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:15,563 INFO L225 Difference]: With dead ends: 393 [2018-09-26 08:13:15,563 INFO L226 Difference]: Without dead ends: 389 [2018-09-26 08:13:15,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:13:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-09-26 08:13:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-09-26 08:13:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-09-26 08:13:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-09-26 08:13:15,568 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 386 [2018-09-26 08:13:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:15,568 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-09-26 08:13:15,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-09-26 08:13:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-09-26 08:13:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-09-26 08:13:15,570 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:15,570 INFO L375 BasicCegarLoop]: trace histogram [192, 191, 1, 1, 1, 1, 1] [2018-09-26 08:13:15,570 INFO L423 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:15,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:15,570 INFO L82 PathProgramCache]: Analyzing trace with hash -439430977, now seen corresponding path program 191 times [2018-09-26 08:13:15,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 36672 backedges. 0 proven. 36672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:17,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:17,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-09-26 08:13:17,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-09-26 08:13:17,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-09-26 08:13:17,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:13:17,021 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 194 states. [2018-09-26 08:13:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:19,159 INFO L93 Difference]: Finished difference Result 395 states and 397 transitions. [2018-09-26 08:13:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-09-26 08:13:19,159 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 388 [2018-09-26 08:13:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:19,159 INFO L225 Difference]: With dead ends: 395 [2018-09-26 08:13:19,159 INFO L226 Difference]: Without dead ends: 391 [2018-09-26 08:13:19,161 INFO L605 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-09-26 08:13:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-09-26 08:13:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-09-26 08:13:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-26 08:13:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2018-09-26 08:13:19,165 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 388 [2018-09-26 08:13:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:19,166 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2018-09-26 08:13:19,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-09-26 08:13:19,166 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2018-09-26 08:13:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-09-26 08:13:19,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:19,168 INFO L375 BasicCegarLoop]: trace histogram [193, 192, 1, 1, 1, 1, 1] [2018-09-26 08:13:19,168 INFO L423 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:19,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:19,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1469932101, now seen corresponding path program 192 times [2018-09-26 08:13:19,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 37056 backedges. 0 proven. 37056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:20,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:20,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-09-26 08:13:20,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-09-26 08:13:20,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-09-26 08:13:20,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:13:20,655 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 195 states. [2018-09-26 08:13:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:22,572 INFO L93 Difference]: Finished difference Result 397 states and 399 transitions. [2018-09-26 08:13:22,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-09-26 08:13:22,572 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 390 [2018-09-26 08:13:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:22,573 INFO L225 Difference]: With dead ends: 397 [2018-09-26 08:13:22,573 INFO L226 Difference]: Without dead ends: 393 [2018-09-26 08:13:22,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:13:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-09-26 08:13:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-09-26 08:13:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-26 08:13:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 394 transitions. [2018-09-26 08:13:22,578 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 394 transitions. Word has length 390 [2018-09-26 08:13:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:22,578 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 394 transitions. [2018-09-26 08:13:22,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-09-26 08:13:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 394 transitions. [2018-09-26 08:13:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-09-26 08:13:22,579 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:22,580 INFO L375 BasicCegarLoop]: trace histogram [194, 193, 1, 1, 1, 1, 1] [2018-09-26 08:13:22,580 INFO L423 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:22,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:22,580 INFO L82 PathProgramCache]: Analyzing trace with hash 355933111, now seen corresponding path program 193 times [2018-09-26 08:13:22,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 37442 backedges. 0 proven. 37442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:23,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:23,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-09-26 08:13:23,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-09-26 08:13:23,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-09-26 08:13:23,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:13:23,971 INFO L87 Difference]: Start difference. First operand 393 states and 394 transitions. Second operand 196 states. [2018-09-26 08:13:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:25,620 INFO L93 Difference]: Finished difference Result 399 states and 401 transitions. [2018-09-26 08:13:25,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-09-26 08:13:25,620 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 392 [2018-09-26 08:13:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:25,621 INFO L225 Difference]: With dead ends: 399 [2018-09-26 08:13:25,621 INFO L226 Difference]: Without dead ends: 395 [2018-09-26 08:13:25,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:13:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-26 08:13:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-26 08:13:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-26 08:13:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 396 transitions. [2018-09-26 08:13:25,626 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 396 transitions. Word has length 392 [2018-09-26 08:13:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:25,626 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 396 transitions. [2018-09-26 08:13:25,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-09-26 08:13:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 396 transitions. [2018-09-26 08:13:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-09-26 08:13:25,627 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:25,627 INFO L375 BasicCegarLoop]: trace histogram [195, 194, 1, 1, 1, 1, 1] [2018-09-26 08:13:25,628 INFO L423 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:25,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1629222221, now seen corresponding path program 194 times [2018-09-26 08:13:25,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 37830 backedges. 0 proven. 37830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:27,111 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:27,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-09-26 08:13:27,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-09-26 08:13:27,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-09-26 08:13:27,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:13:27,115 INFO L87 Difference]: Start difference. First operand 395 states and 396 transitions. Second operand 197 states. [2018-09-26 08:13:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:28,633 INFO L93 Difference]: Finished difference Result 401 states and 403 transitions. [2018-09-26 08:13:28,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-09-26 08:13:28,633 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 394 [2018-09-26 08:13:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:28,634 INFO L225 Difference]: With dead ends: 401 [2018-09-26 08:13:28,634 INFO L226 Difference]: Without dead ends: 397 [2018-09-26 08:13:28,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:13:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-09-26 08:13:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-09-26 08:13:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-26 08:13:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2018-09-26 08:13:28,640 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 394 [2018-09-26 08:13:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:28,640 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2018-09-26 08:13:28,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-09-26 08:13:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2018-09-26 08:13:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-09-26 08:13:28,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:28,641 INFO L375 BasicCegarLoop]: trace histogram [196, 195, 1, 1, 1, 1, 1] [2018-09-26 08:13:28,642 INFO L423 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:28,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1896950447, now seen corresponding path program 195 times [2018-09-26 08:13:28,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 38220 backedges. 0 proven. 38220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:30,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:30,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-09-26 08:13:30,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-09-26 08:13:30,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-09-26 08:13:30,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:13:30,220 INFO L87 Difference]: Start difference. First operand 397 states and 398 transitions. Second operand 198 states. [2018-09-26 08:13:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:32,243 INFO L93 Difference]: Finished difference Result 403 states and 405 transitions. [2018-09-26 08:13:32,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-09-26 08:13:32,243 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 396 [2018-09-26 08:13:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:32,243 INFO L225 Difference]: With dead ends: 403 [2018-09-26 08:13:32,243 INFO L226 Difference]: Without dead ends: 399 [2018-09-26 08:13:32,245 INFO L605 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-09-26 08:13:32,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-09-26 08:13:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-09-26 08:13:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-09-26 08:13:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-09-26 08:13:32,249 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 396 [2018-09-26 08:13:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:32,249 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-09-26 08:13:32,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-09-26 08:13:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-09-26 08:13:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-09-26 08:13:32,250 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:32,250 INFO L375 BasicCegarLoop]: trace histogram [197, 196, 1, 1, 1, 1, 1] [2018-09-26 08:13:32,251 INFO L423 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:32,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:32,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1819687851, now seen corresponding path program 196 times [2018-09-26 08:13:32,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 38612 backedges. 0 proven. 38612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:33,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:33,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-09-26 08:13:33,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-09-26 08:13:33,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-09-26 08:13:33,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:13:33,818 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 199 states. [2018-09-26 08:13:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:35,666 INFO L93 Difference]: Finished difference Result 405 states and 407 transitions. [2018-09-26 08:13:35,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-09-26 08:13:35,666 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 398 [2018-09-26 08:13:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:35,667 INFO L225 Difference]: With dead ends: 405 [2018-09-26 08:13:35,667 INFO L226 Difference]: Without dead ends: 401 [2018-09-26 08:13:35,669 INFO L605 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-09-26 08:13:35,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-09-26 08:13:35,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2018-09-26 08:13:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-09-26 08:13:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 402 transitions. [2018-09-26 08:13:35,672 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 402 transitions. Word has length 398 [2018-09-26 08:13:35,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:35,673 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 402 transitions. [2018-09-26 08:13:35,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-09-26 08:13:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 402 transitions. [2018-09-26 08:13:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-09-26 08:13:35,674 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:35,674 INFO L375 BasicCegarLoop]: trace histogram [198, 197, 1, 1, 1, 1, 1] [2018-09-26 08:13:35,674 INFO L423 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:35,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:35,674 INFO L82 PathProgramCache]: Analyzing trace with hash 584777127, now seen corresponding path program 197 times [2018-09-26 08:13:35,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 39006 backedges. 0 proven. 39006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:37,270 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:37,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-09-26 08:13:37,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-09-26 08:13:37,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-09-26 08:13:37,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:13:37,273 INFO L87 Difference]: Start difference. First operand 401 states and 402 transitions. Second operand 200 states. [2018-09-26 08:13:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:39,359 INFO L93 Difference]: Finished difference Result 407 states and 409 transitions. [2018-09-26 08:13:39,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-09-26 08:13:39,360 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 400 [2018-09-26 08:13:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:39,360 INFO L225 Difference]: With dead ends: 407 [2018-09-26 08:13:39,360 INFO L226 Difference]: Without dead ends: 403 [2018-09-26 08:13:39,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:13:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-09-26 08:13:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-09-26 08:13:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-26 08:13:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 404 transitions. [2018-09-26 08:13:39,366 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 404 transitions. Word has length 400 [2018-09-26 08:13:39,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:39,366 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 404 transitions. [2018-09-26 08:13:39,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-09-26 08:13:39,366 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 404 transitions. [2018-09-26 08:13:39,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-09-26 08:13:39,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:39,367 INFO L375 BasicCegarLoop]: trace histogram [199, 198, 1, 1, 1, 1, 1] [2018-09-26 08:13:39,367 INFO L423 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:39,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash -753454941, now seen corresponding path program 198 times [2018-09-26 08:13:39,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 39402 backedges. 0 proven. 39402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:40,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:40,895 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-09-26 08:13:40,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-09-26 08:13:40,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-09-26 08:13:40,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:13:40,900 INFO L87 Difference]: Start difference. First operand 403 states and 404 transitions. Second operand 201 states. [2018-09-26 08:13:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:43,368 INFO L93 Difference]: Finished difference Result 409 states and 411 transitions. [2018-09-26 08:13:43,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-09-26 08:13:43,368 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 402 [2018-09-26 08:13:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:43,369 INFO L225 Difference]: With dead ends: 409 [2018-09-26 08:13:43,369 INFO L226 Difference]: Without dead ends: 405 [2018-09-26 08:13:43,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:13:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-09-26 08:13:43,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2018-09-26 08:13:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-09-26 08:13:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-09-26 08:13:43,374 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 402 [2018-09-26 08:13:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:43,375 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-09-26 08:13:43,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-09-26 08:13:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-09-26 08:13:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-09-26 08:13:43,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:43,376 INFO L375 BasicCegarLoop]: trace histogram [200, 199, 1, 1, 1, 1, 1] [2018-09-26 08:13:43,376 INFO L423 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:43,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:43,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1695716511, now seen corresponding path program 199 times [2018-09-26 08:13:43,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 39800 backedges. 0 proven. 39800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:44,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:44,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-09-26 08:13:44,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-09-26 08:13:44,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-09-26 08:13:44,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:13:44,938 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 202 states. [2018-09-26 08:13:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:47,198 INFO L93 Difference]: Finished difference Result 411 states and 413 transitions. [2018-09-26 08:13:47,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-09-26 08:13:47,198 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 404 [2018-09-26 08:13:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:47,199 INFO L225 Difference]: With dead ends: 411 [2018-09-26 08:13:47,199 INFO L226 Difference]: Without dead ends: 407 [2018-09-26 08:13:47,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:13:47,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-09-26 08:13:47,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-09-26 08:13:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-09-26 08:13:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2018-09-26 08:13:47,204 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 404 [2018-09-26 08:13:47,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:47,205 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2018-09-26 08:13:47,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-09-26 08:13:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2018-09-26 08:13:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-09-26 08:13:47,206 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:47,206 INFO L375 BasicCegarLoop]: trace histogram [201, 200, 1, 1, 1, 1, 1] [2018-09-26 08:13:47,206 INFO L423 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:47,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:47,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1707403675, now seen corresponding path program 200 times [2018-09-26 08:13:47,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 40200 backedges. 0 proven. 40200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:48,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:48,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-09-26 08:13:48,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-09-26 08:13:48,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-09-26 08:13:48,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:13:48,870 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 203 states. [2018-09-26 08:13:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:50,222 INFO L93 Difference]: Finished difference Result 413 states and 415 transitions. [2018-09-26 08:13:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-09-26 08:13:50,223 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 406 [2018-09-26 08:13:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:50,223 INFO L225 Difference]: With dead ends: 413 [2018-09-26 08:13:50,224 INFO L226 Difference]: Without dead ends: 409 [2018-09-26 08:13:50,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:13:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-09-26 08:13:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2018-09-26 08:13:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-26 08:13:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-09-26 08:13:50,230 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 406 [2018-09-26 08:13:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:50,231 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-09-26 08:13:50,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-09-26 08:13:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-09-26 08:13:50,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-09-26 08:13:50,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:50,233 INFO L375 BasicCegarLoop]: trace histogram [202, 201, 1, 1, 1, 1, 1] [2018-09-26 08:13:50,233 INFO L423 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:50,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:50,233 INFO L82 PathProgramCache]: Analyzing trace with hash 53866391, now seen corresponding path program 201 times [2018-09-26 08:13:50,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 40602 backedges. 0 proven. 40602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:51,803 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:51,804 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-09-26 08:13:51,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-09-26 08:13:51,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-09-26 08:13:51,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:13:51,809 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 204 states. [2018-09-26 08:13:52,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:52,482 INFO L93 Difference]: Finished difference Result 415 states and 417 transitions. [2018-09-26 08:13:52,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-09-26 08:13:52,482 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 408 [2018-09-26 08:13:52,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:52,483 INFO L225 Difference]: With dead ends: 415 [2018-09-26 08:13:52,483 INFO L226 Difference]: Without dead ends: 411 [2018-09-26 08:13:52,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:13:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-09-26 08:13:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-09-26 08:13:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-26 08:13:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2018-09-26 08:13:52,490 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 408 [2018-09-26 08:13:52,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:52,490 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 412 transitions. [2018-09-26 08:13:52,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-09-26 08:13:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 412 transitions. [2018-09-26 08:13:52,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-09-26 08:13:52,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:52,492 INFO L375 BasicCegarLoop]: trace histogram [203, 202, 1, 1, 1, 1, 1] [2018-09-26 08:13:52,492 INFO L423 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:52,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:52,492 INFO L82 PathProgramCache]: Analyzing trace with hash 142435987, now seen corresponding path program 202 times [2018-09-26 08:13:52,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 41006 backedges. 0 proven. 41006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:54,222 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:54,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-09-26 08:13:54,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-09-26 08:13:54,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-09-26 08:13:54,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:13:54,225 INFO L87 Difference]: Start difference. First operand 411 states and 412 transitions. Second operand 205 states. [2018-09-26 08:13:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:56,122 INFO L93 Difference]: Finished difference Result 417 states and 419 transitions. [2018-09-26 08:13:56,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-09-26 08:13:56,122 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 410 [2018-09-26 08:13:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:56,123 INFO L225 Difference]: With dead ends: 417 [2018-09-26 08:13:56,124 INFO L226 Difference]: Without dead ends: 413 [2018-09-26 08:13:56,125 INFO L605 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-09-26 08:13:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-09-26 08:13:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-09-26 08:13:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-09-26 08:13:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 414 transitions. [2018-09-26 08:13:56,129 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 414 transitions. Word has length 410 [2018-09-26 08:13:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:56,129 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 414 transitions. [2018-09-26 08:13:56,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-09-26 08:13:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 414 transitions. [2018-09-26 08:13:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-09-26 08:13:56,130 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:56,130 INFO L375 BasicCegarLoop]: trace histogram [204, 203, 1, 1, 1, 1, 1] [2018-09-26 08:13:56,131 INFO L423 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:56,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:56,131 INFO L82 PathProgramCache]: Analyzing trace with hash -641528177, now seen corresponding path program 203 times [2018-09-26 08:13:56,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 41412 backedges. 0 proven. 41412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:57,812 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:57,812 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-09-26 08:13:57,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-09-26 08:13:57,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-09-26 08:13:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:13:57,817 INFO L87 Difference]: Start difference. First operand 413 states and 414 transitions. Second operand 206 states. [2018-09-26 08:14:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:00,277 INFO L93 Difference]: Finished difference Result 419 states and 421 transitions. [2018-09-26 08:14:00,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-09-26 08:14:00,277 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 412 [2018-09-26 08:14:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:00,278 INFO L225 Difference]: With dead ends: 419 [2018-09-26 08:14:00,278 INFO L226 Difference]: Without dead ends: 415 [2018-09-26 08:14:00,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:14:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-09-26 08:14:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2018-09-26 08:14:00,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-09-26 08:14:00,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-09-26 08:14:00,285 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 412 [2018-09-26 08:14:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:00,286 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-09-26 08:14:00,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-09-26 08:14:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-09-26 08:14:00,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-09-26 08:14:00,287 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:00,287 INFO L375 BasicCegarLoop]: trace histogram [205, 204, 1, 1, 1, 1, 1] [2018-09-26 08:14:00,287 INFO L423 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:00,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:00,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1883154315, now seen corresponding path program 204 times [2018-09-26 08:14:00,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 41820 backedges. 0 proven. 41820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:01,910 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:01,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206] total 206 [2018-09-26 08:14:01,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-09-26 08:14:01,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-09-26 08:14:01,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:14:01,916 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 207 states. [2018-09-26 08:14:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:02,757 INFO L93 Difference]: Finished difference Result 421 states and 423 transitions. [2018-09-26 08:14:02,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-09-26 08:14:02,757 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 414 [2018-09-26 08:14:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:02,758 INFO L225 Difference]: With dead ends: 421 [2018-09-26 08:14:02,758 INFO L226 Difference]: Without dead ends: 417 [2018-09-26 08:14:02,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:14:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-09-26 08:14:02,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-09-26 08:14:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-09-26 08:14:02,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-09-26 08:14:02,764 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 414 [2018-09-26 08:14:02,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:02,764 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-09-26 08:14:02,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-09-26 08:14:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-09-26 08:14:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-09-26 08:14:02,765 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:02,766 INFO L375 BasicCegarLoop]: trace histogram [206, 205, 1, 1, 1, 1, 1] [2018-09-26 08:14:02,766 INFO L423 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:02,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:02,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1446506887, now seen corresponding path program 205 times [2018-09-26 08:14:02,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 42230 backedges. 0 proven. 42230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:04,504 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:04,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-09-26 08:14:04,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-09-26 08:14:04,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-09-26 08:14:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:14:04,506 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 208 states. [2018-09-26 08:14:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:06,288 INFO L93 Difference]: Finished difference Result 423 states and 425 transitions. [2018-09-26 08:14:06,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-09-26 08:14:06,288 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 416 [2018-09-26 08:14:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:06,289 INFO L225 Difference]: With dead ends: 423 [2018-09-26 08:14:06,289 INFO L226 Difference]: Without dead ends: 419 [2018-09-26 08:14:06,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:14:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-09-26 08:14:06,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-09-26 08:14:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-09-26 08:14:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 420 transitions. [2018-09-26 08:14:06,294 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 420 transitions. Word has length 416 [2018-09-26 08:14:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:06,294 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 420 transitions. [2018-09-26 08:14:06,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-09-26 08:14:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 420 transitions. [2018-09-26 08:14:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-09-26 08:14:06,295 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:06,295 INFO L375 BasicCegarLoop]: trace histogram [207, 206, 1, 1, 1, 1, 1] [2018-09-26 08:14:06,296 INFO L423 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:06,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:06,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1559843709, now seen corresponding path program 206 times [2018-09-26 08:14:06,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 42642 backedges. 0 proven. 42642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:08,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:08,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208] total 208 [2018-09-26 08:14:08,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-09-26 08:14:08,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-09-26 08:14:08,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:14:08,136 INFO L87 Difference]: Start difference. First operand 419 states and 420 transitions. Second operand 209 states. [2018-09-26 08:14:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:10,711 INFO L93 Difference]: Finished difference Result 425 states and 427 transitions. [2018-09-26 08:14:10,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-09-26 08:14:10,711 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 418 [2018-09-26 08:14:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:10,712 INFO L225 Difference]: With dead ends: 425 [2018-09-26 08:14:10,712 INFO L226 Difference]: Without dead ends: 421 [2018-09-26 08:14:10,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:14:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-09-26 08:14:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2018-09-26 08:14:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-26 08:14:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 422 transitions. [2018-09-26 08:14:10,718 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 422 transitions. Word has length 418 [2018-09-26 08:14:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:10,718 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 422 transitions. [2018-09-26 08:14:10,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-09-26 08:14:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 422 transitions. [2018-09-26 08:14:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-09-26 08:14:10,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:10,719 INFO L375 BasicCegarLoop]: trace histogram [208, 207, 1, 1, 1, 1, 1] [2018-09-26 08:14:10,719 INFO L423 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:10,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:10,720 INFO L82 PathProgramCache]: Analyzing trace with hash -149776257, now seen corresponding path program 207 times [2018-09-26 08:14:10,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 43056 backedges. 0 proven. 43056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:12,496 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:12,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-09-26 08:14:12,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-09-26 08:14:12,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-09-26 08:14:12,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:14:12,501 INFO L87 Difference]: Start difference. First operand 421 states and 422 transitions. Second operand 210 states. [2018-09-26 08:14:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:13,349 INFO L93 Difference]: Finished difference Result 427 states and 429 transitions. [2018-09-26 08:14:13,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-09-26 08:14:13,350 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 420 [2018-09-26 08:14:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:13,350 INFO L225 Difference]: With dead ends: 427 [2018-09-26 08:14:13,350 INFO L226 Difference]: Without dead ends: 423 [2018-09-26 08:14:13,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:14:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-26 08:14:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-09-26 08:14:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-09-26 08:14:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2018-09-26 08:14:13,357 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 420 [2018-09-26 08:14:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:13,357 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2018-09-26 08:14:13,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-09-26 08:14:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2018-09-26 08:14:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-09-26 08:14:13,358 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:13,359 INFO L375 BasicCegarLoop]: trace histogram [209, 208, 1, 1, 1, 1, 1] [2018-09-26 08:14:13,359 INFO L423 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:13,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2010346875, now seen corresponding path program 208 times [2018-09-26 08:14:13,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 43472 backedges. 0 proven. 43472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:15,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:15,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210] total 210 [2018-09-26 08:14:15,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-09-26 08:14:15,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-09-26 08:14:15,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:14:15,191 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 211 states. [2018-09-26 08:14:17,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:17,871 INFO L93 Difference]: Finished difference Result 429 states and 431 transitions. [2018-09-26 08:14:17,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-09-26 08:14:17,872 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 422 [2018-09-26 08:14:17,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:17,872 INFO L225 Difference]: With dead ends: 429 [2018-09-26 08:14:17,872 INFO L226 Difference]: Without dead ends: 425 [2018-09-26 08:14:17,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:14:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-09-26 08:14:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-09-26 08:14:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-09-26 08:14:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-09-26 08:14:17,877 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 422 [2018-09-26 08:14:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:17,877 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-09-26 08:14:17,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-09-26 08:14:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-09-26 08:14:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-09-26 08:14:17,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:17,879 INFO L375 BasicCegarLoop]: trace histogram [210, 209, 1, 1, 1, 1, 1] [2018-09-26 08:14:17,879 INFO L423 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:17,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:17,879 INFO L82 PathProgramCache]: Analyzing trace with hash -875494537, now seen corresponding path program 209 times [2018-09-26 08:14:17,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 43890 backedges. 0 proven. 43890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:19,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:19,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-09-26 08:14:19,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-09-26 08:14:19,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-09-26 08:14:19,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:14:19,773 INFO L87 Difference]: Start difference. First operand 425 states and 426 transitions. Second operand 212 states. [2018-09-26 08:14:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:21,075 INFO L93 Difference]: Finished difference Result 431 states and 433 transitions. [2018-09-26 08:14:21,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-09-26 08:14:21,076 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 424 [2018-09-26 08:14:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:21,076 INFO L225 Difference]: With dead ends: 431 [2018-09-26 08:14:21,076 INFO L226 Difference]: Without dead ends: 427 [2018-09-26 08:14:21,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:14:21,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-09-26 08:14:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-09-26 08:14:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-26 08:14:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 428 transitions. [2018-09-26 08:14:21,082 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 428 transitions. Word has length 424 [2018-09-26 08:14:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:21,083 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 428 transitions. [2018-09-26 08:14:21,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-09-26 08:14:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 428 transitions. [2018-09-26 08:14:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-09-26 08:14:21,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:21,084 INFO L375 BasicCegarLoop]: trace histogram [211, 210, 1, 1, 1, 1, 1] [2018-09-26 08:14:21,084 INFO L423 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:21,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:21,085 INFO L82 PathProgramCache]: Analyzing trace with hash 379781747, now seen corresponding path program 210 times [2018-09-26 08:14:21,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:22,934 INFO L134 CoverageAnalysis]: Checked inductivity of 44310 backedges. 0 proven. 44310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:22,935 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:22,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212] total 212 [2018-09-26 08:14:22,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-09-26 08:14:22,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-09-26 08:14:22,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:14:22,942 INFO L87 Difference]: Start difference. First operand 427 states and 428 transitions. Second operand 213 states. [2018-09-26 08:14:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:25,923 INFO L93 Difference]: Finished difference Result 433 states and 435 transitions. [2018-09-26 08:14:25,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-09-26 08:14:25,923 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 426 [2018-09-26 08:14:25,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:25,924 INFO L225 Difference]: With dead ends: 433 [2018-09-26 08:14:25,924 INFO L226 Difference]: Without dead ends: 429 [2018-09-26 08:14:25,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:14:25,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-09-26 08:14:25,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2018-09-26 08:14:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-09-26 08:14:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 430 transitions. [2018-09-26 08:14:25,930 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 430 transitions. Word has length 426 [2018-09-26 08:14:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:25,930 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 430 transitions. [2018-09-26 08:14:25,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-09-26 08:14:25,930 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 430 transitions. [2018-09-26 08:14:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-09-26 08:14:25,931 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:25,931 INFO L375 BasicCegarLoop]: trace histogram [212, 211, 1, 1, 1, 1, 1] [2018-09-26 08:14:25,932 INFO L423 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:25,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:25,932 INFO L82 PathProgramCache]: Analyzing trace with hash -185519505, now seen corresponding path program 211 times [2018-09-26 08:14:25,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 44732 backedges. 0 proven. 44732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:27,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:27,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-09-26 08:14:27,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-09-26 08:14:27,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-09-26 08:14:27,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:14:27,796 INFO L87 Difference]: Start difference. First operand 429 states and 430 transitions. Second operand 214 states. [2018-09-26 08:14:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:28,937 INFO L93 Difference]: Finished difference Result 435 states and 437 transitions. [2018-09-26 08:14:28,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-09-26 08:14:28,938 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 428 [2018-09-26 08:14:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:28,938 INFO L225 Difference]: With dead ends: 435 [2018-09-26 08:14:28,938 INFO L226 Difference]: Without dead ends: 431 [2018-09-26 08:14:28,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:14:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-09-26 08:14:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-09-26 08:14:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-09-26 08:14:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-09-26 08:14:28,944 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 428 [2018-09-26 08:14:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:28,944 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-09-26 08:14:28,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-09-26 08:14:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-09-26 08:14:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-09-26 08:14:28,945 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:28,945 INFO L375 BasicCegarLoop]: trace histogram [213, 212, 1, 1, 1, 1, 1] [2018-09-26 08:14:28,946 INFO L423 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:28,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:28,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2020823915, now seen corresponding path program 212 times [2018-09-26 08:14:28,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 45156 backedges. 0 proven. 45156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:30,918 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:30,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214] total 214 [2018-09-26 08:14:30,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-09-26 08:14:30,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-09-26 08:14:30,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:14:30,924 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 215 states. [2018-09-26 08:14:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:32,663 INFO L93 Difference]: Finished difference Result 437 states and 439 transitions. [2018-09-26 08:14:32,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-09-26 08:14:32,663 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 430 [2018-09-26 08:14:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:32,664 INFO L225 Difference]: With dead ends: 437 [2018-09-26 08:14:32,664 INFO L226 Difference]: Without dead ends: 433 [2018-09-26 08:14:32,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:14:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-09-26 08:14:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-09-26 08:14:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-09-26 08:14:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 434 transitions. [2018-09-26 08:14:32,670 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 434 transitions. Word has length 430 [2018-09-26 08:14:32,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:32,670 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 434 transitions. [2018-09-26 08:14:32,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-09-26 08:14:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 434 transitions. [2018-09-26 08:14:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-09-26 08:14:32,671 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:32,671 INFO L375 BasicCegarLoop]: trace histogram [214, 213, 1, 1, 1, 1, 1] [2018-09-26 08:14:32,671 INFO L423 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:32,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:32,672 INFO L82 PathProgramCache]: Analyzing trace with hash 603006311, now seen corresponding path program 213 times [2018-09-26 08:14:32,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 45582 backedges. 0 proven. 45582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:34,477 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:34,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-09-26 08:14:34,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-09-26 08:14:34,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-09-26 08:14:34,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:14:34,485 INFO L87 Difference]: Start difference. First operand 433 states and 434 transitions. Second operand 216 states. [2018-09-26 08:14:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:37,381 INFO L93 Difference]: Finished difference Result 439 states and 441 transitions. [2018-09-26 08:14:37,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-09-26 08:14:37,382 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 432 [2018-09-26 08:14:37,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:37,382 INFO L225 Difference]: With dead ends: 439 [2018-09-26 08:14:37,383 INFO L226 Difference]: Without dead ends: 435 [2018-09-26 08:14:37,385 INFO L605 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-09-26 08:14:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-09-26 08:14:37,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-09-26 08:14:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-09-26 08:14:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 436 transitions. [2018-09-26 08:14:37,389 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 436 transitions. Word has length 432 [2018-09-26 08:14:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:37,389 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 436 transitions. [2018-09-26 08:14:37,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-09-26 08:14:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 436 transitions. [2018-09-26 08:14:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-09-26 08:14:37,390 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:37,390 INFO L375 BasicCegarLoop]: trace histogram [215, 214, 1, 1, 1, 1, 1] [2018-09-26 08:14:37,391 INFO L423 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:37,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:37,391 INFO L82 PathProgramCache]: Analyzing trace with hash -415078301, now seen corresponding path program 214 times [2018-09-26 08:14:37,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 46010 backedges. 0 proven. 46010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:39,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:39,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216] total 216 [2018-09-26 08:14:39,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-09-26 08:14:39,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-09-26 08:14:39,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:14:39,300 INFO L87 Difference]: Start difference. First operand 435 states and 436 transitions. Second operand 217 states. [2018-09-26 08:14:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:40,843 INFO L93 Difference]: Finished difference Result 441 states and 443 transitions. [2018-09-26 08:14:40,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-09-26 08:14:40,844 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 434 [2018-09-26 08:14:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:40,845 INFO L225 Difference]: With dead ends: 441 [2018-09-26 08:14:40,845 INFO L226 Difference]: Without dead ends: 437 [2018-09-26 08:14:40,847 INFO L605 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-09-26 08:14:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-09-26 08:14:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2018-09-26 08:14:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-09-26 08:14:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-09-26 08:14:40,851 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 434 [2018-09-26 08:14:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:40,852 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-09-26 08:14:40,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-09-26 08:14:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-09-26 08:14:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-09-26 08:14:40,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:40,853 INFO L375 BasicCegarLoop]: trace histogram [216, 215, 1, 1, 1, 1, 1] [2018-09-26 08:14:40,854 INFO L423 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:40,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash 458153055, now seen corresponding path program 215 times [2018-09-26 08:14:40,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 46440 backedges. 0 proven. 46440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:42,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:42,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-09-26 08:14:42,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-09-26 08:14:42,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-09-26 08:14:42,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:14:42,797 INFO L87 Difference]: Start difference. First operand 437 states and 438 transitions. Second operand 218 states. [2018-09-26 08:14:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:45,091 INFO L93 Difference]: Finished difference Result 443 states and 445 transitions. [2018-09-26 08:14:45,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-09-26 08:14:45,092 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 436 [2018-09-26 08:14:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:45,092 INFO L225 Difference]: With dead ends: 443 [2018-09-26 08:14:45,092 INFO L226 Difference]: Without dead ends: 439 [2018-09-26 08:14:45,093 INFO L605 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-09-26 08:14:45,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-09-26 08:14:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2018-09-26 08:14:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-09-26 08:14:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-09-26 08:14:45,097 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 436 [2018-09-26 08:14:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:45,097 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-09-26 08:14:45,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-09-26 08:14:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-09-26 08:14:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-09-26 08:14:45,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:45,099 INFO L375 BasicCegarLoop]: trace histogram [217, 216, 1, 1, 1, 1, 1] [2018-09-26 08:14:45,099 INFO L423 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:45,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2114863451, now seen corresponding path program 216 times [2018-09-26 08:14:45,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 46872 backedges. 0 proven. 46872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:47,055 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:47,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218] total 218 [2018-09-26 08:14:47,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-09-26 08:14:47,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-09-26 08:14:47,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-09-26 08:14:47,061 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 219 states. Received shutdown request... [2018-09-26 08:14:50,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-09-26 08:14:50,197 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:14:50,202 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:14:50,203 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:14:50 BoogieIcfgContainer [2018-09-26 08:14:50,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:14:50,204 INFO L168 Benchmark]: Toolchain (without parser) took 258935.45 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 1.0 GB in the end (delta: 431.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-26 08:14:50,205 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 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-09-26 08:14:50,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.90 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-09-26 08:14:50,206 INFO L168 Benchmark]: Boogie Preprocessor took 22.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:14:50,206 INFO L168 Benchmark]: RCFGBuilder took 272.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:14:50,207 INFO L168 Benchmark]: TraceAbstraction took 258591.76 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 1.0 GB in the end (delta: 421.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-26 08:14:50,209 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.16 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.90 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 22.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 272.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 258591.76 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 1.0 GB in the end (delta: 421.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 83). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and FLOYD_HOARE automaton (currently 215 states, 219 states before enhancement), while ReachableStatesComputation was computing reachable states (426 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. TIMEOUT Result, 258.5s OverallTime, 217 OverallIterations, 217 TraceHistogramMax, 116.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1514 SDtfs, 0 SDslu, 56831 SDs, 0 SdLazy, 45987 SolverSat, 440 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23870 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 23653 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 77.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=439occurred in iteration=216, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 216 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 38.7s SatisfiabilityAnalysisTime, 91.7s InterpolantComputationTime, 48174 NumberOfCodeBlocks, 48174 NumberOfCodeBlocksAsserted, 217 NumberOfCheckSat, 47957 ConstructedInterpolants, 0 QuantifiedInterpolants, 41725845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 217 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3406032 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/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-14-50-219.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-14-50-219.csv Completed graceful shutdown