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/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:26:19,210 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:26:19,212 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:26:19,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:26:19,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:26:19,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:26:19,232 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:26:19,235 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:26:19,237 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:26:19,238 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:26:19,246 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:26:19,246 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:26:19,247 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:26:19,248 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:26:19,252 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:26:19,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:26:19,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:26:19,257 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:26:19,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:26:19,263 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:26:19,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:26:19,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:26:19,276 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:26:19,276 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:26:19,276 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:26:19,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:26:19,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:26:19,280 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:26:19,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:26:19,284 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:26:19,284 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:26:19,285 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:26:19,285 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:26:19,285 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:26:19,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:26:19,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:26:19,290 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:26:19,303 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:26:19,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:26:19,304 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:26:19,304 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:26:19,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:26:19,305 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:26:19,305 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:26:19,305 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:26:19,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:26:19,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:26:19,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:26:19,407 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:26:19,408 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:26:19,409 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl [2018-09-26 08:26:19,409 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl' [2018-09-26 08:26:19,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:26:19,467 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:26:19,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:26:19,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:26:19,468 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:26:19,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:19" (1/1) ... [2018-09-26 08:26:19,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:19" (1/1) ... [2018-09-26 08:26:19,508 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:26:19,508 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:26:19,508 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:26:19,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:26:19,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:26:19,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:26:19,512 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:26:19,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:19" (1/1) ... [2018-09-26 08:26:19,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:19" (1/1) ... [2018-09-26 08:26:19,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:19" (1/1) ... [2018-09-26 08:26:19,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:19" (1/1) ... [2018-09-26 08:26:19,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:19" (1/1) ... [2018-09-26 08:26:19,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:19" (1/1) ... [2018-09-26 08:26:19,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:19" (1/1) ... [2018-09-26 08:26:19,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:26:19,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:26:19,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:26:19,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:26:19,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:19" (1/1) ... [2018-09-26 08:26:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2018-09-26 08:26:19,634 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2018-09-26 08:26:19,776 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:26:19,777 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:26:19 BoogieIcfgContainer [2018-09-26 08:26:19,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:26:19,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:26:19,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:26:19,783 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:26:19,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:19" (1/2) ... [2018-09-26 08:26:19,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152f3b6 and model type doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:26:19, skipping insertion in model container [2018-09-26 08:26:19,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:26:19" (2/2) ... [2018-09-26 08:26:19,788 INFO L112 eAbstractionObserver]: Analyzing ICFG doubleLoopUniformIterations.bpl [2018-09-26 08:26:19,799 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:26:19,811 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-26 08:26:19,865 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:26:19,866 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:26:19,866 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:26:19,866 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:26:19,866 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:26:19,867 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:26:19,867 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:26:19,867 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:26:19,867 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:26:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-26 08:26:19,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:26:19,897 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:19,898 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:26:19,899 INFO L423 AbstractCegarLoop]: === Iteration 1 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:19,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:19,908 INFO L82 PathProgramCache]: Analyzing trace with hash 926725, now seen corresponding path program 1 times [2018-09-26 08:26:19,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:19,993 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:26:19,996 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:26:19,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 08:26:20,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:26:20,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:26:20,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:26:20,025 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-09-26 08:26:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,065 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-09-26 08:26:20,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:26:20,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-26 08:26:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,077 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:26:20,078 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:26:20,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:26:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:26:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:26:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:26:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-09-26 08:26:20,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 4 [2018-09-26 08:26:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,128 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-09-26 08:26:20,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:26:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-09-26 08:26:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:26:20,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,129 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 08:26:20,129 INFO L423 AbstractCegarLoop]: === Iteration 2 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,130 INFO L82 PathProgramCache]: Analyzing trace with hash 28728519, now seen corresponding path program 1 times [2018-09-26 08:26:20,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,146 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:26:20,147 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:26:20,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 08:26:20,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:26:20,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:26:20,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:26:20,150 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 3 states. [2018-09-26 08:26:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,160 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-09-26 08:26:20,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:26:20,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-09-26 08:26:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,161 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:26:20,162 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:26:20,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:26:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:26:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:26:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:26:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-26 08:26:20,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-09-26 08:26:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,167 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-26 08:26:20,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:26:20,170 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-26 08:26:20,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:26:20,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,171 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:26:20,171 INFO L423 AbstractCegarLoop]: === Iteration 3 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,172 INFO L82 PathProgramCache]: Analyzing trace with hash 891297133, now seen corresponding path program 1 times [2018-09-26 08:26:20,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:20,196 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:26:20,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:26:20,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:26:20,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:26:20,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:26:20,198 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-09-26 08:26:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,229 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-09-26 08:26:20,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:26:20,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-26 08:26:20,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,230 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:26:20,230 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:26:20,231 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:26:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:26:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:26:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:26:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-09-26 08:26:20,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-09-26 08:26:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,235 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-09-26 08:26:20,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:26:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-09-26 08:26:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:26:20,236 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,236 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:26:20,236 INFO L423 AbstractCegarLoop]: === Iteration 4 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1860345825, now seen corresponding path program 1 times [2018-09-26 08:26:20,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,289 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:26:20,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-09-26 08:26:20,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:26:20,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:26:20,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:26:20,291 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-09-26 08:26:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,320 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-09-26 08:26:20,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:26:20,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-09-26 08:26:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,321 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:26:20,321 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:26:20,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:26:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:26:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-09-26 08:26:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:26:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-09-26 08:26:20,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-09-26 08:26:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,331 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-09-26 08:26:20,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:26:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-09-26 08:26:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:26:20,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,332 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:26:20,332 INFO L423 AbstractCegarLoop]: === Iteration 5 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1836084205, now seen corresponding path program 2 times [2018-09-26 08:26:20,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:20,383 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:26:20,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:26:20,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:26:20,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:26:20,384 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-09-26 08:26:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,407 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-09-26 08:26:20,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:26:20,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-26 08:26:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,408 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:26:20,408 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:26:20,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:26:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:26:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:26:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:26:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-26 08:26:20,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2018-09-26 08:26:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,418 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-26 08:26:20,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:26:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-26 08:26:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:26:20,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,419 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:26:20,419 INFO L423 AbstractCegarLoop]: === Iteration 6 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1860095751, now seen corresponding path program 3 times [2018-09-26 08:26:20,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:20,468 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:26:20,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:26:20,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:26:20,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:26:20,470 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-09-26 08:26:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,500 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-26 08:26:20,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:26:20,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-26 08:26:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,501 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:26:20,501 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:26:20,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:26:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:26:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:26:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:26:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-09-26 08:26:20,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-09-26 08:26:20,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,507 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-09-26 08:26:20,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:26:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-09-26 08:26:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:26:20,508 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,508 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:26:20,509 INFO L423 AbstractCegarLoop]: === Iteration 7 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1828331911, now seen corresponding path program 4 times [2018-09-26 08:26:20,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,569 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:26:20,570 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:26:20,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:26:20,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:26:20,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:26:20,571 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 5 states. [2018-09-26 08:26:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,606 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-09-26 08:26:20,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:26:20,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-09-26 08:26:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,607 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:26:20,608 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:26:20,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:26:20,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:26:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-09-26 08:26:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:26:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-09-26 08:26:20,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-09-26 08:26:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,616 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-09-26 08:26:20,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:26:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-09-26 08:26:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:26:20,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,617 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-09-26 08:26:20,617 INFO L423 AbstractCegarLoop]: === Iteration 8 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,617 INFO L82 PathProgramCache]: Analyzing trace with hash 843652871, now seen corresponding path program 5 times [2018-09-26 08:26:20,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:20,667 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:26:20,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:26:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:26:20,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:26:20,668 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 6 states. [2018-09-26 08:26:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,703 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-09-26 08:26:20,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:26:20,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-09-26 08:26:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,704 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:26:20,704 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:26:20,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:26:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:26:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:26:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:26:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-26 08:26:20,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2018-09-26 08:26:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,710 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-26 08:26:20,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:26:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-26 08:26:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:26:20,711 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,711 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-09-26 08:26:20,712 INFO L423 AbstractCegarLoop]: === Iteration 9 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1588010797, now seen corresponding path program 6 times [2018-09-26 08:26:20,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:20,736 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:26:20,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:26:20,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:26:20,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:26:20,737 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-09-26 08:26:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,760 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-09-26 08:26:20,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:26:20,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-09-26 08:26:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,763 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:26:20,763 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:26:20,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:26:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:26:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:26:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:26:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-09-26 08:26:20,771 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-09-26 08:26:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,771 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-09-26 08:26:20,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:26:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-09-26 08:26:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:26:20,775 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,775 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2018-09-26 08:26:20,775 INFO L423 AbstractCegarLoop]: === Iteration 10 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1983632929, now seen corresponding path program 7 times [2018-09-26 08:26:20,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,837 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:26:20,837 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:26:20,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:26:20,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:26:20,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:26:20,839 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 6 states. [2018-09-26 08:26:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,885 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-09-26 08:26:20,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:26:20,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-09-26 08:26:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,886 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:26:20,886 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:26:20,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:26:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:26:20,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-09-26 08:26:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:26:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-09-26 08:26:20,893 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-09-26 08:26:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,893 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-09-26 08:26:20,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:26:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-09-26 08:26:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:26:20,894 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,894 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-09-26 08:26:20,895 INFO L423 AbstractCegarLoop]: === Iteration 11 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1363017133, now seen corresponding path program 8 times [2018-09-26 08:26:20,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:20,918 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:26:20,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:26:20,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:26:20,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:26:20,920 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 7 states. [2018-09-26 08:26:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,937 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-09-26 08:26:20,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:26:20,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-09-26 08:26:20,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,939 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:26:20,939 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:26:20,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:26:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:26:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:26:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:26:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-26 08:26:20,944 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2018-09-26 08:26:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,944 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-26 08:26:20,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:26:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-26 08:26:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:26:20,945 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,945 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-09-26 08:26:20,945 INFO L423 AbstractCegarLoop]: === Iteration 12 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1331690937, now seen corresponding path program 9 times [2018-09-26 08:26:20,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:20,968 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,968 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:26:20,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:26:20,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:26:20,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:26:20,969 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-09-26 08:26:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,988 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-26 08:26:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:26:20,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-09-26 08:26:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,989 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:26:20,989 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:26:20,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:26:20,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:26:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:26:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:26:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-09-26 08:26:20,995 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-09-26 08:26:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,996 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-09-26 08:26:20,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:26:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-09-26 08:26:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:26:20,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,997 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2018-09-26 08:26:20,997 INFO L423 AbstractCegarLoop]: === Iteration 13 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1667192391, now seen corresponding path program 10 times [2018-09-26 08:26:20,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,036 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:26:21,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:26:21,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:26:21,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:26:21,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:26:21,038 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2018-09-26 08:26:21,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,103 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-09-26 08:26:21,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:26:21,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-09-26 08:26:21,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,105 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:26:21,106 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:26:21,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:26:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:26:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-09-26 08:26:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:26:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-09-26 08:26:21,126 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-09-26 08:26:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,126 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-09-26 08:26:21,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:26:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-09-26 08:26:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:26:21,127 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:21,127 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-09-26 08:26:21,128 INFO L423 AbstractCegarLoop]: === Iteration 14 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:21,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:21,128 INFO L82 PathProgramCache]: Analyzing trace with hash 143295047, now seen corresponding path program 11 times [2018-09-26 08:26:21,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:21,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:26:21,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:26:21,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:26:21,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:26:21,173 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2018-09-26 08:26:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,190 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-09-26 08:26:21,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:26:21,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:26:21,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,192 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:26:21,192 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:26:21,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:26:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:26:21,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:26:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:26:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-26 08:26:21,198 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2018-09-26 08:26:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,198 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-26 08:26:21,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:26:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-26 08:26:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:26:21,199 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:21,200 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-09-26 08:26:21,200 INFO L423 AbstractCegarLoop]: === Iteration 15 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:21,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:21,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1788276499, now seen corresponding path program 12 times [2018-09-26 08:26:21,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:21,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:26:21,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:26:21,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:26:21,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:26:21,250 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-09-26 08:26:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,275 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-09-26 08:26:21,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:26:21,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:26:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,276 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:26:21,277 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:26:21,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:26:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:26:21,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:26:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:26:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-09-26 08:26:21,284 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-09-26 08:26:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,284 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-09-26 08:26:21,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:26:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-09-26 08:26:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:26:21,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:21,285 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1] [2018-09-26 08:26:21,290 INFO L423 AbstractCegarLoop]: === Iteration 16 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:21,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash 397941857, now seen corresponding path program 13 times [2018-09-26 08:26:21,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,359 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:26:21,359 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,359 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:26:21,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:26:21,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:26:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:26:21,364 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2018-09-26 08:26:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,401 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-09-26 08:26:21,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:26:21,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-09-26 08:26:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,403 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:26:21,403 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:26:21,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:26:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:26:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-09-26 08:26:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:26:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-09-26 08:26:21,413 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-09-26 08:26:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,413 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-09-26 08:26:21,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:26:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-09-26 08:26:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:26:21,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:21,414 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-09-26 08:26:21,418 INFO L423 AbstractCegarLoop]: === Iteration 17 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:21,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:21,418 INFO L82 PathProgramCache]: Analyzing trace with hash -548765843, now seen corresponding path program 14 times [2018-09-26 08:26:21,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:21,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:26:21,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:26:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:26:21,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:26:21,460 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 9 states. [2018-09-26 08:26:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,479 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-09-26 08:26:21,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:26:21,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:26:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,480 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:26:21,480 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:26:21,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:26:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:26:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:26:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:26:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-26 08:26:21,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2018-09-26 08:26:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,497 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-26 08:26:21,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:26:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-26 08:26:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:26:21,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:21,498 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-09-26 08:26:21,503 INFO L423 AbstractCegarLoop]: === Iteration 18 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:21,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:21,504 INFO L82 PathProgramCache]: Analyzing trace with hash -297941625, now seen corresponding path program 15 times [2018-09-26 08:26:21,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:21,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:26:21,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:26:21,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:26:21,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:26:21,534 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2018-09-26 08:26:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,550 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-09-26 08:26:21,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:26:21,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:26:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,553 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:26:21,553 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:26:21,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 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:26:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:26:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:26:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:26:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-09-26 08:26:21,561 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-09-26 08:26:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,562 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-09-26 08:26:21,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:26:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-09-26 08:26:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:26:21,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:21,563 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2018-09-26 08:26:21,564 INFO L423 AbstractCegarLoop]: === Iteration 19 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:21,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash -646317305, now seen corresponding path program 16 times [2018-09-26 08:26:21,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,613 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:26:21,614 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,614 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:26:21,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:26:21,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:26:21,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:26:21,615 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 9 states. [2018-09-26 08:26:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,652 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-09-26 08:26:21,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:26:21,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-09-26 08:26:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,653 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:26:21,653 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:26:21,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:26:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:26:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-09-26 08:26:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:26:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-09-26 08:26:21,661 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-09-26 08:26:21,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,661 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-09-26 08:26:21,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:26:21,661 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-09-26 08:26:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:26:21,662 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:21,662 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-09-26 08:26:21,663 INFO L423 AbstractCegarLoop]: === Iteration 20 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:21,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1438938503, now seen corresponding path program 17 times [2018-09-26 08:26:21,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,693 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:21,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:26:21,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:26:21,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:26:21,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:26:21,695 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 10 states. [2018-09-26 08:26:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,717 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-09-26 08:26:21,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:26:21,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:26:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,718 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:26:21,718 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:26:21,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:26:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:26:21,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:26:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:26:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-26 08:26:21,726 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-09-26 08:26:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,727 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-26 08:26:21,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:26:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-26 08:26:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:26:21,728 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:21,728 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-09-26 08:26:21,728 INFO L423 AbstractCegarLoop]: === Iteration 21 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:21,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:21,729 INFO L82 PathProgramCache]: Analyzing trace with hash 624554669, now seen corresponding path program 18 times [2018-09-26 08:26:21,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:21,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:26:21,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:26:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:26:21,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:26:21,759 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-09-26 08:26:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,776 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-09-26 08:26:21,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:26:21,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:26:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,777 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:26:21,777 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:26:21,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 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:26:21,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:26:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:26:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:26:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-09-26 08:26:21,784 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-09-26 08:26:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,784 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-09-26 08:26:21,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:26:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-09-26 08:26:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:26:21,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:21,785 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1] [2018-09-26 08:26:21,786 INFO L423 AbstractCegarLoop]: === Iteration 22 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:21,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2113703263, now seen corresponding path program 19 times [2018-09-26 08:26:21,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,835 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:26:21,835 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:26:21,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:26:21,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:26:21,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:26:21,837 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 10 states. [2018-09-26 08:26:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,888 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-09-26 08:26:21,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:26:21,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-09-26 08:26:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,890 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:26:21,891 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:26:21,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:26:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:26:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-09-26 08:26:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:26:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-09-26 08:26:21,903 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-09-26 08:26:21,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,904 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-09-26 08:26:21,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:26:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-09-26 08:26:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:26:21,905 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:21,905 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-09-26 08:26:21,907 INFO L423 AbstractCegarLoop]: === Iteration 23 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:21,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1100353235, now seen corresponding path program 20 times [2018-09-26 08:26:21,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:21,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:26:21,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:26:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:26:21,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:26:21,957 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 11 states. [2018-09-26 08:26:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,983 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-09-26 08:26:21,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:26:21,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:26:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,985 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:26:21,985 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:26:21,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:26:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:26:21,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:26:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:26:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-09-26 08:26:21,998 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-09-26 08:26:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,998 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-09-26 08:26:21,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:26:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-09-26 08:26:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:26:21,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:22,001 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-09-26 08:26:22,001 INFO L423 AbstractCegarLoop]: === Iteration 24 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:22,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:22,002 INFO L82 PathProgramCache]: Analyzing trace with hash -576448313, now seen corresponding path program 21 times [2018-09-26 08:26:22,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:22,048 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:22,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:26:22,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:26:22,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:26:22,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:26:22,050 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-09-26 08:26:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:22,075 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-09-26 08:26:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:26:22,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:26:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:22,076 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:26:22,076 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:26:22,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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:26:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:26:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:26:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:26:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-09-26 08:26:22,086 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-09-26 08:26:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:22,087 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-09-26 08:26:22,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:26:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-09-26 08:26:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:26:22,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:22,088 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2018-09-26 08:26:22,088 INFO L423 AbstractCegarLoop]: === Iteration 25 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:22,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:22,090 INFO L82 PathProgramCache]: Analyzing trace with hash -690090041, now seen corresponding path program 22 times [2018-09-26 08:26:22,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:22,146 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:26:22,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:22,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:26:22,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:26:22,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:26:22,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:26:22,148 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 11 states. [2018-09-26 08:26:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:22,214 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-09-26 08:26:22,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:26:22,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-09-26 08:26:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:22,215 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:26:22,216 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:26:22,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:26:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:26:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-09-26 08:26:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:26:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-09-26 08:26:22,234 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-09-26 08:26:22,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:22,234 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-09-26 08:26:22,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:26:22,234 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-09-26 08:26:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:26:22,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:22,235 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-09-26 08:26:22,238 INFO L423 AbstractCegarLoop]: === Iteration 26 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:22,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:22,239 INFO L82 PathProgramCache]: Analyzing trace with hash 81983687, now seen corresponding path program 23 times [2018-09-26 08:26:22,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:22,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:22,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:26:22,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:26:22,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:26:22,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:26:22,283 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 12 states. [2018-09-26 08:26:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:22,315 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-09-26 08:26:22,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:26:22,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-09-26 08:26:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:22,316 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:26:22,316 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:26:22,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:26:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:26:22,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:26:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:26:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-26 08:26:22,330 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-09-26 08:26:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:22,330 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-26 08:26:22,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:26:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-26 08:26:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:26:22,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:22,331 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-09-26 08:26:22,331 INFO L423 AbstractCegarLoop]: === Iteration 27 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:22,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:22,332 INFO L82 PathProgramCache]: Analyzing trace with hash -856832915, now seen corresponding path program 24 times [2018-09-26 08:26:22,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:22,372 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:22,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:26:22,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:26:22,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:26:22,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:26:22,375 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-09-26 08:26:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:22,397 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-09-26 08:26:22,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:26:22,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-09-26 08:26:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:22,398 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:26:22,398 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:26:22,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 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:26:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:26:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:26:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:26:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-09-26 08:26:22,408 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-09-26 08:26:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:22,409 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-09-26 08:26:22,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:26:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-09-26 08:26:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:26:22,410 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:22,410 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1] [2018-09-26 08:26:22,410 INFO L423 AbstractCegarLoop]: === Iteration 28 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:22,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:22,411 INFO L82 PathProgramCache]: Analyzing trace with hash -792078111, now seen corresponding path program 25 times [2018-09-26 08:26:22,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:22,478 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:26:22,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:22,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:26:22,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:26:22,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:26:22,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:26:22,480 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-09-26 08:26:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:22,550 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-09-26 08:26:22,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:26:22,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-09-26 08:26:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:22,551 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:26:22,551 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:26:22,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:26:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:26:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-09-26 08:26:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:26:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-09-26 08:26:22,562 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-09-26 08:26:22,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:22,563 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-09-26 08:26:22,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:26:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-09-26 08:26:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:26:22,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:22,564 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2018-09-26 08:26:22,564 INFO L423 AbstractCegarLoop]: === Iteration 29 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:22,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:22,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1215320813, now seen corresponding path program 26 times [2018-09-26 08:26:22,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:22,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:22,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:26:22,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:26:22,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:26:22,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:26:22,606 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 13 states. [2018-09-26 08:26:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:22,637 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-09-26 08:26:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:26:22,637 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-09-26 08:26:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:22,638 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:26:22,638 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:26:22,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:26:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:26:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:26:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:26:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-26 08:26:22,652 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2018-09-26 08:26:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:22,653 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-26 08:26:22,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:26:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-26 08:26:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:26:22,653 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:22,654 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2018-09-26 08:26:22,654 INFO L423 AbstractCegarLoop]: === Iteration 30 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:22,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:22,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2118190073, now seen corresponding path program 27 times [2018-09-26 08:26:22,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:22,703 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:22,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:26:22,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:26:22,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:26:22,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:26:22,704 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-09-26 08:26:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:22,727 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-09-26 08:26:22,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:26:22,728 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-09-26 08:26:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:22,728 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:26:22,728 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:26:22,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 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:26:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:26:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:26:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:26:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-09-26 08:26:22,739 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-09-26 08:26:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:22,739 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-09-26 08:26:22,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:26:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-09-26 08:26:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:26:22,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:22,742 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2018-09-26 08:26:22,742 INFO L423 AbstractCegarLoop]: === Iteration 31 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:22,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:22,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1239444345, now seen corresponding path program 28 times [2018-09-26 08:26:22,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:22,806 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:26:22,807 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:22,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:26:22,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:26:22,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:26:22,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:26:22,810 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2018-09-26 08:26:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:22,881 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-09-26 08:26:22,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:26:22,881 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-09-26 08:26:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:22,882 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:26:22,882 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:26:22,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:26:22,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:26:22,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-09-26 08:26:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:26:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-09-26 08:26:22,900 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-09-26 08:26:22,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:22,900 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-09-26 08:26:22,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:26:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-09-26 08:26:22,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:26:22,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:22,901 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-09-26 08:26:22,901 INFO L423 AbstractCegarLoop]: === Iteration 32 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:22,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash 231869447, now seen corresponding path program 29 times [2018-09-26 08:26:22,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:22,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:22,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:26:22,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:26:22,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:26:22,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:26:22,941 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2018-09-26 08:26:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:22,974 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-09-26 08:26:22,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:26:22,975 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-09-26 08:26:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:22,975 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:26:22,975 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:26:22,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:26:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:26:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:26:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:26:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-26 08:26:22,990 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2018-09-26 08:26:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:22,990 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-26 08:26:22,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:26:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-26 08:26:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:26:22,991 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:22,991 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-09-26 08:26:22,992 INFO L423 AbstractCegarLoop]: === Iteration 33 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:22,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:22,992 INFO L82 PathProgramCache]: Analyzing trace with hash -27752915, now seen corresponding path program 30 times [2018-09-26 08:26:22,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:23,046 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:23,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:26:23,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:26:23,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:26:23,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:26:23,047 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-09-26 08:26:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:23,072 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-09-26 08:26:23,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:26:23,072 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-09-26 08:26:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:23,073 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:26:23,073 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:26:23,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 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:26:23,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:26:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:26:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:26:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-09-26 08:26:23,085 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-09-26 08:26:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:23,086 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-09-26 08:26:23,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:26:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-09-26 08:26:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:26:23,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:23,087 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1] [2018-09-26 08:26:23,087 INFO L423 AbstractCegarLoop]: === Iteration 34 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:23,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash -860401887, now seen corresponding path program 31 times [2018-09-26 08:26:23,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:23,157 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:26:23,158 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:23,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:26:23,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:26:23,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:26:23,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:26:23,159 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2018-09-26 08:26:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:23,244 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-09-26 08:26:23,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:26:23,245 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-09-26 08:26:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:23,245 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:26:23,246 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:26:23,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:26:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:26:23,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-09-26 08:26:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:26:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-09-26 08:26:23,263 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-09-26 08:26:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:23,264 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-09-26 08:26:23,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:26:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-09-26 08:26:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:26:23,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:23,264 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2018-09-26 08:26:23,265 INFO L423 AbstractCegarLoop]: === Iteration 35 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:23,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:23,265 INFO L82 PathProgramCache]: Analyzing trace with hash -902716243, now seen corresponding path program 32 times [2018-09-26 08:26:23,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:23,310 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:23,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:26:23,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:26:23,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:26:23,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:26:23,311 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 15 states. [2018-09-26 08:26:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:23,348 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-09-26 08:26:23,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:26:23,348 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-09-26 08:26:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:23,349 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:26:23,349 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:26:23,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:26:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:26:23,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:26:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:26:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-26 08:26:23,371 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2018-09-26 08:26:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:23,372 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-26 08:26:23,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:26:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-26 08:26:23,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:26:23,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:23,373 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2018-09-26 08:26:23,373 INFO L423 AbstractCegarLoop]: === Iteration 36 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:23,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:23,373 INFO L82 PathProgramCache]: Analyzing trace with hash -361074873, now seen corresponding path program 33 times [2018-09-26 08:26:23,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:23,428 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:23,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:26:23,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:26:23,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:26:23,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:26:23,432 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-09-26 08:26:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:23,471 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-26 08:26:23,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:26:23,472 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-09-26 08:26:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:23,472 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:26:23,473 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:26:23,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 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:26:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:26:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:26:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:26:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-09-26 08:26:23,485 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-09-26 08:26:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:23,485 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-09-26 08:26:23,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:26:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-09-26 08:26:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:26:23,486 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:23,486 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1] [2018-09-26 08:26:23,487 INFO L423 AbstractCegarLoop]: === Iteration 37 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:23,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1691519303, now seen corresponding path program 34 times [2018-09-26 08:26:23,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:23,563 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:26:23,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:23,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:26:23,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:26:23,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:26:23,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:26:23,565 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2018-09-26 08:26:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:23,654 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-09-26 08:26:23,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:26:23,654 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-09-26 08:26:23,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:23,654 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:26:23,655 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:26:23,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:26:23,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:26:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2018-09-26 08:26:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:26:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-09-26 08:26:23,668 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-09-26 08:26:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:23,668 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-09-26 08:26:23,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:26:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-09-26 08:26:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:26:23,669 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:23,669 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2018-09-26 08:26:23,670 INFO L423 AbstractCegarLoop]: === Iteration 38 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:23,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:23,671 INFO L82 PathProgramCache]: Analyzing trace with hash 897429319, now seen corresponding path program 35 times [2018-09-26 08:26:23,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:23,717 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:23,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:26:23,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:26:23,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:26:23,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:26:23,718 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 16 states. [2018-09-26 08:26:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:23,756 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-09-26 08:26:23,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:26:23,756 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-26 08:26:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:23,757 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:26:23,757 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:26:23,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:26:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:26:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:26:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:26:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-26 08:26:23,772 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2018-09-26 08:26:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:23,773 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-26 08:26:23,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:26:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-26 08:26:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:26:23,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:23,774 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2018-09-26 08:26:23,774 INFO L423 AbstractCegarLoop]: === Iteration 39 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:23,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:23,774 INFO L82 PathProgramCache]: Analyzing trace with hash 508442605, now seen corresponding path program 36 times [2018-09-26 08:26:23,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:23,820 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:23,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:26:23,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:26:23,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:26:23,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:26:23,822 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-09-26 08:26:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:23,847 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-09-26 08:26:23,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:26:23,848 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-26 08:26:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:23,848 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:26:23,848 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:26:23,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 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:26:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:26:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:26:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:26:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-09-26 08:26:23,860 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-09-26 08:26:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:23,861 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-09-26 08:26:23,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:26:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-09-26 08:26:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:26:23,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:23,862 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1] [2018-09-26 08:26:23,862 INFO L423 AbstractCegarLoop]: === Iteration 40 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:23,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:23,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1418209951, now seen corresponding path program 37 times [2018-09-26 08:26:23,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:23,993 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:26:23,994 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:23,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:26:23,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:26:23,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:26:23,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:26:23,995 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 16 states. [2018-09-26 08:26:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:24,094 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-09-26 08:26:24,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:26:24,095 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-09-26 08:26:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:24,097 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:26:24,097 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:26:24,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:26:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:26:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-09-26 08:26:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:26:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-09-26 08:26:24,113 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-09-26 08:26:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:24,113 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-09-26 08:26:24,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:26:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-09-26 08:26:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:26:24,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:24,114 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2018-09-26 08:26:24,114 INFO L423 AbstractCegarLoop]: === Iteration 41 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:24,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:24,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1014897043, now seen corresponding path program 38 times [2018-09-26 08:26:24,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:24,161 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:24,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:26:24,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:26:24,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:26:24,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:26:24,162 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 17 states. [2018-09-26 08:26:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:24,206 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-09-26 08:26:24,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:26:24,207 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-09-26 08:26:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:24,207 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:26:24,207 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:26:24,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:26:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:26:24,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:26:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:26:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-09-26 08:26:24,221 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2018-09-26 08:26:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:24,221 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-09-26 08:26:24,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:26:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-09-26 08:26:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:26:24,222 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:24,222 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2018-09-26 08:26:24,222 INFO L423 AbstractCegarLoop]: === Iteration 42 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:24,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:24,222 INFO L82 PathProgramCache]: Analyzing trace with hash -188583289, now seen corresponding path program 39 times [2018-09-26 08:26:24,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:24,282 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:24,282 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:26:24,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:26:24,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:26:24,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:26:24,283 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-09-26 08:26:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:24,307 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-09-26 08:26:24,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:26:24,307 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-09-26 08:26:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:24,308 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:26:24,308 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:26:24,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 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:26:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:26:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:26:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:26:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-09-26 08:26:24,320 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-09-26 08:26:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:24,321 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-09-26 08:26:24,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:26:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-09-26 08:26:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:26:24,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:24,322 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1] [2018-09-26 08:26:24,322 INFO L423 AbstractCegarLoop]: === Iteration 43 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:24,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:24,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1551176185, now seen corresponding path program 40 times [2018-09-26 08:26:24,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:24,397 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:26:24,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:24,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:26:24,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:26:24,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:26:24,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:26:24,399 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 17 states. [2018-09-26 08:26:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:24,502 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-09-26 08:26:24,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:26:24,502 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2018-09-26 08:26:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:24,503 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:26:24,503 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:26:24,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:26:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:26:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2018-09-26 08:26:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:26:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-09-26 08:26:24,519 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-09-26 08:26:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:24,519 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-09-26 08:26:24,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:26:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-09-26 08:26:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:26:24,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:24,519 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2018-09-26 08:26:24,520 INFO L423 AbstractCegarLoop]: === Iteration 44 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:24,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:24,520 INFO L82 PathProgramCache]: Analyzing trace with hash -841883001, now seen corresponding path program 41 times [2018-09-26 08:26:24,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:24,570 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:24,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:26:24,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:26:24,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:26:24,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:26:24,572 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 18 states. [2018-09-26 08:26:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:24,624 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-09-26 08:26:24,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:26:24,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-09-26 08:26:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:24,625 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:26:24,625 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:26:24,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:26:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:26:24,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:26:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:26:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-26 08:26:24,639 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2018-09-26 08:26:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:24,640 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-26 08:26:24,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:26:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-26 08:26:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:26:24,640 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:24,640 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2018-09-26 08:26:24,641 INFO L423 AbstractCegarLoop]: === Iteration 45 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:24,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:24,642 INFO L82 PathProgramCache]: Analyzing trace with hash -995960403, now seen corresponding path program 42 times [2018-09-26 08:26:24,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:24,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:24,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:26:24,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:26:24,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:26:24,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:26:24,721 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-09-26 08:26:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:24,751 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-09-26 08:26:24,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:26:24,751 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-09-26 08:26:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:24,752 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:26:24,752 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:26:24,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 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:26:24,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:26:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:26:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:26:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-09-26 08:26:24,765 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-09-26 08:26:24,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:24,765 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-09-26 08:26:24,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:26:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-09-26 08:26:24,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:26:24,766 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:24,766 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1] [2018-09-26 08:26:24,766 INFO L423 AbstractCegarLoop]: === Iteration 46 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:24,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash -810062943, now seen corresponding path program 43 times [2018-09-26 08:26:24,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:24,843 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:26:24,843 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:24,843 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:26:24,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:26:24,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:26:24,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:26:24,844 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 18 states. [2018-09-26 08:26:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:24,955 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-09-26 08:26:24,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:26:24,956 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-09-26 08:26:24,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:24,956 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:26:24,956 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:26:24,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:26:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:26:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-09-26 08:26:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:26:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-09-26 08:26:24,972 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-09-26 08:26:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:24,972 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-09-26 08:26:24,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:26:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-09-26 08:26:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:26:24,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:24,973 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2018-09-26 08:26:24,973 INFO L423 AbstractCegarLoop]: === Iteration 47 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:24,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash 657791021, now seen corresponding path program 44 times [2018-09-26 08:26:24,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:25,018 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:25,018 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:26:25,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:26:25,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:26:25,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:26:25,020 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 19 states. [2018-09-26 08:26:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:25,070 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-09-26 08:26:25,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:26:25,070 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-09-26 08:26:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:25,071 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:26:25,071 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:26:25,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:26:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:26:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:26:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:26:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-09-26 08:26:25,085 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2018-09-26 08:26:25,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:25,085 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-09-26 08:26:25,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:26:25,086 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-09-26 08:26:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:26:25,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:25,086 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2018-09-26 08:26:25,086 INFO L423 AbstractCegarLoop]: === Iteration 48 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:25,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash 176358855, now seen corresponding path program 45 times [2018-09-26 08:26:25,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:25,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:25,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:26:25,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:26:25,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:26:25,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:26:25,137 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2018-09-26 08:26:25,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:25,166 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-09-26 08:26:25,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:26:25,166 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-09-26 08:26:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:25,167 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:26:25,167 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:26:25,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 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:26:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:26:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:26:25,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:26:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-09-26 08:26:25,182 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-09-26 08:26:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:25,183 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-09-26 08:26:25,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:26:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-09-26 08:26:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:26:25,183 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:25,183 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1] [2018-09-26 08:26:25,184 INFO L423 AbstractCegarLoop]: === Iteration 49 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:25,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:25,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1172095687, now seen corresponding path program 46 times [2018-09-26 08:26:25,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:25,266 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:26:25,267 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:25,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:26:25,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:26:25,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:26:25,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:26:25,268 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 19 states. [2018-09-26 08:26:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:25,390 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-09-26 08:26:25,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:26:25,390 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2018-09-26 08:26:25,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:25,391 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:26:25,391 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:26:25,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:26:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:26:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2018-09-26 08:26:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:26:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-09-26 08:26:25,408 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-09-26 08:26:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:25,409 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-09-26 08:26:25,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:26:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-09-26 08:26:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:26:25,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:25,410 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2018-09-26 08:26:25,410 INFO L423 AbstractCegarLoop]: === Iteration 50 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:25,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:25,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1975166407, now seen corresponding path program 47 times [2018-09-26 08:26:25,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:25,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:25,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:26:25,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:26:25,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:26:25,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:26:25,461 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 20 states. [2018-09-26 08:26:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:25,512 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-09-26 08:26:25,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:26:25,512 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-09-26 08:26:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:25,512 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:26:25,513 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:26:25,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:26:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:26:25,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:26:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:26:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-26 08:26:25,527 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2018-09-26 08:26:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:25,527 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-26 08:26:25,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:26:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-26 08:26:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:26:25,528 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:25,528 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2018-09-26 08:26:25,528 INFO L423 AbstractCegarLoop]: === Iteration 51 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:25,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:25,529 INFO L82 PathProgramCache]: Analyzing trace with hash -64328851, now seen corresponding path program 48 times [2018-09-26 08:26:25,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:25,593 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:25,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:26:25,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:26:25,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:26:25,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:26:25,595 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-09-26 08:26:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:25,627 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-09-26 08:26:25,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:26:25,628 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-09-26 08:26:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:25,628 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:26:25,628 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:26:25,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 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:26:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:26:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:26:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:26:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-09-26 08:26:25,647 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-09-26 08:26:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:25,647 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-09-26 08:26:25,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:26:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-09-26 08:26:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:26:25,648 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:25,648 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1] [2018-09-26 08:26:25,649 INFO L423 AbstractCegarLoop]: === Iteration 52 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:25,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:25,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1994255903, now seen corresponding path program 49 times [2018-09-26 08:26:25,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:25,736 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:26:25,736 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:25,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:26:25,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:26:25,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:26:25,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:26:25,737 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 20 states. [2018-09-26 08:26:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:25,890 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-09-26 08:26:25,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:26:25,890 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-09-26 08:26:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:25,891 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:26:25,891 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:26:25,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:26:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:26:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2018-09-26 08:26:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:26:25,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-09-26 08:26:25,909 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-09-26 08:26:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:25,910 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-09-26 08:26:25,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:26:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-09-26 08:26:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:26:25,910 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:25,911 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2018-09-26 08:26:25,911 INFO L423 AbstractCegarLoop]: === Iteration 53 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:25,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:25,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1692452371, now seen corresponding path program 50 times [2018-09-26 08:26:25,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:25,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:25,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:26:25,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:26:25,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:26:25,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:26:25,970 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 21 states. [2018-09-26 08:26:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:26,021 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-09-26 08:26:26,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:26:26,022 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-09-26 08:26:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:26,022 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:26:26,023 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:26:26,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:26:26,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:26:26,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:26:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:26:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-09-26 08:26:26,040 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2018-09-26 08:26:26,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:26,040 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-09-26 08:26:26,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:26:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-09-26 08:26:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:26:26,041 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:26,041 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2018-09-26 08:26:26,046 INFO L423 AbstractCegarLoop]: === Iteration 54 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:26,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:26,047 INFO L82 PathProgramCache]: Analyzing trace with hash -492295929, now seen corresponding path program 51 times [2018-09-26 08:26:26,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:26,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:26,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:26:26,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:26:26,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:26:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:26:26,111 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2018-09-26 08:26:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:26,141 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-09-26 08:26:26,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:26:26,141 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-09-26 08:26:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:26,142 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:26:26,142 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:26:26,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 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:26:26,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:26:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:26:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:26:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-09-26 08:26:26,160 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-09-26 08:26:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:26,160 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-09-26 08:26:26,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:26:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-09-26 08:26:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:26:26,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:26,161 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1] [2018-09-26 08:26:26,161 INFO L423 AbstractCegarLoop]: === Iteration 55 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:26,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1918633863, now seen corresponding path program 52 times [2018-09-26 08:26:26,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:26,252 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:26:26,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:26,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:26:26,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:26:26,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:26:26,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:26:26,253 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 21 states. [2018-09-26 08:26:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:26,411 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-09-26 08:26:26,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:26:26,412 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-09-26 08:26:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:26,412 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:26:26,412 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:26:26,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:26:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:26:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2018-09-26 08:26:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:26:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-09-26 08:26:26,434 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-09-26 08:26:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:26,435 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-09-26 08:26:26,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:26:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-09-26 08:26:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:26:26,435 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:26,435 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2018-09-26 08:26:26,436 INFO L423 AbstractCegarLoop]: === Iteration 56 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:26,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:26,436 INFO L82 PathProgramCache]: Analyzing trace with hash -651953913, now seen corresponding path program 53 times [2018-09-26 08:26:26,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:26,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:26,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:26:26,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:26:26,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:26:26,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:26:26,509 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 22 states. [2018-09-26 08:26:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:26,577 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-09-26 08:26:26,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:26:26,577 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-09-26 08:26:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:26,578 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:26:26,578 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:26:26,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:26:26,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:26:26,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:26:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:26:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-26 08:26:26,599 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 42 [2018-09-26 08:26:26,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:26,599 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-26 08:26:26,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:26:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-26 08:26:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:26:26,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:26,600 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2018-09-26 08:26:26,600 INFO L423 AbstractCegarLoop]: === Iteration 57 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:26,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:26,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2101809875, now seen corresponding path program 54 times [2018-09-26 08:26:26,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:26,675 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:26,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:26:26,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:26:26,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:26:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:26:26,676 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-09-26 08:26:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:26,715 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-09-26 08:26:26,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:26:26,715 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-09-26 08:26:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:26,716 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:26:26,716 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:26:26,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 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:26:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:26:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:26:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:26:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-09-26 08:26:26,738 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-09-26 08:26:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:26,738 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-09-26 08:26:26,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:26:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-09-26 08:26:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:26:26,739 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:26,739 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1] [2018-09-26 08:26:26,740 INFO L423 AbstractCegarLoop]: === Iteration 58 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:26,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:26,740 INFO L82 PathProgramCache]: Analyzing trace with hash -731658207, now seen corresponding path program 55 times [2018-09-26 08:26:26,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:26,919 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:26:26,919 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:26,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:26:26,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:26:26,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:26:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:26:26,920 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 22 states. [2018-09-26 08:26:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:27,084 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-09-26 08:26:27,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:26:27,084 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-09-26 08:26:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:27,085 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:26:27,085 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:26:27,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:26:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:26:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2018-09-26 08:26:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:26:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-09-26 08:26:27,109 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2018-09-26 08:26:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:27,110 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-09-26 08:26:27,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:26:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-09-26 08:26:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:26:27,111 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:27,111 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2018-09-26 08:26:27,111 INFO L423 AbstractCegarLoop]: === Iteration 59 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:27,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:27,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1206629459, now seen corresponding path program 56 times [2018-09-26 08:26:27,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:27,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:27,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:26:27,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:26:27,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:26:27,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:26:27,172 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 23 states. [2018-09-26 08:26:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:27,241 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-09-26 08:26:27,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:26:27,241 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-09-26 08:26:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:27,242 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:26:27,242 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:26:27,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:26:27,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:26:27,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:26:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:26:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-26 08:26:27,261 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 44 [2018-09-26 08:26:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:27,262 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-26 08:26:27,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:26:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-26 08:26:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:26:27,262 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:27,263 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2018-09-26 08:26:27,263 INFO L423 AbstractCegarLoop]: === Iteration 60 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:27,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:27,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1092475975, now seen corresponding path program 57 times [2018-09-26 08:26:27,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:27,330 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:27,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:26:27,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:26:27,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:26:27,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:26:27,331 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2018-09-26 08:26:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:27,363 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-09-26 08:26:27,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:26:27,363 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-09-26 08:26:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:27,364 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:26:27,364 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:26:27,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 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:26:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:26:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:26:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:26:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-09-26 08:26:27,383 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-09-26 08:26:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:27,383 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-09-26 08:26:27,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:26:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-09-26 08:26:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:26:27,384 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:27,384 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1] [2018-09-26 08:26:27,384 INFO L423 AbstractCegarLoop]: === Iteration 61 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:27,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:27,385 INFO L82 PathProgramCache]: Analyzing trace with hash -493044665, now seen corresponding path program 58 times [2018-09-26 08:26:27,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:27,503 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:26:27,504 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:27,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:26:27,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:26:27,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:26:27,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:26:27,505 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 23 states. [2018-09-26 08:26:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:27,671 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-09-26 08:26:27,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:26:27,672 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-09-26 08:26:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:27,672 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:26:27,672 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:26:27,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:26:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:26:27,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-09-26 08:26:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:26:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-09-26 08:26:27,693 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2018-09-26 08:26:27,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:27,693 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-09-26 08:26:27,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:26:27,693 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-09-26 08:26:27,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:26:27,694 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:27,694 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2018-09-26 08:26:27,694 INFO L423 AbstractCegarLoop]: === Iteration 62 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:27,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:27,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1895423047, now seen corresponding path program 59 times [2018-09-26 08:26:27,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:27,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:27,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:26:27,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:26:27,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:26:27,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:26:27,773 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 24 states. [2018-09-26 08:26:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:27,841 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-09-26 08:26:27,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:26:27,841 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-09-26 08:26:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:27,842 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:26:27,842 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:26:27,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:26:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:26:27,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:26:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:26:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-26 08:26:27,863 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 46 [2018-09-26 08:26:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:27,863 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-26 08:26:27,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:26:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-26 08:26:27,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:26:27,864 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:27,864 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2018-09-26 08:26:27,864 INFO L423 AbstractCegarLoop]: === Iteration 63 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:27,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:27,864 INFO L82 PathProgramCache]: Analyzing trace with hash 153247469, now seen corresponding path program 60 times [2018-09-26 08:26:27,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:27,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:27,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:26:27,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:26:27,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:26:27,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:26:27,940 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-09-26 08:26:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:27,975 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-09-26 08:26:27,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:26:27,976 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-09-26 08:26:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:27,976 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:26:27,976 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:26:27,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 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:26:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:26:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:26:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:26:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-09-26 08:26:27,997 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2018-09-26 08:26:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:27,998 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-09-26 08:26:27,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:26:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-09-26 08:26:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:26:27,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:27,998 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1] [2018-09-26 08:26:27,999 INFO L423 AbstractCegarLoop]: === Iteration 64 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:27,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:27,999 INFO L82 PathProgramCache]: Analyzing trace with hash 455642721, now seen corresponding path program 61 times [2018-09-26 08:26:27,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:28,103 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:26:28,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:28,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:26:28,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:26:28,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:26:28,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:26:28,104 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 24 states. [2018-09-26 08:26:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:28,297 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-09-26 08:26:28,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:26:28,297 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-09-26 08:26:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:28,298 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:26:28,298 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:26:28,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:26:28,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:26:28,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2018-09-26 08:26:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:26:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-09-26 08:26:28,327 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 47 [2018-09-26 08:26:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:28,327 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-09-26 08:26:28,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:26:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-09-26 08:26:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:26:28,328 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:28,328 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2018-09-26 08:26:28,328 INFO L423 AbstractCegarLoop]: === Iteration 65 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:28,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:28,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1239960941, now seen corresponding path program 62 times [2018-09-26 08:26:28,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:28,394 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:28,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:26:28,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:26:28,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:26:28,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:26:28,396 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 25 states. [2018-09-26 08:26:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:28,475 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-09-26 08:26:28,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:26:28,475 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-09-26 08:26:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:28,476 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:26:28,476 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:26:28,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:26:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:26:28,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:26:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:26:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-09-26 08:26:28,497 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 48 [2018-09-26 08:26:28,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:28,497 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-09-26 08:26:28,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:26:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-09-26 08:26:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:26:28,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:28,498 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2018-09-26 08:26:28,498 INFO L423 AbstractCegarLoop]: === Iteration 66 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:28,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1227874425, now seen corresponding path program 63 times [2018-09-26 08:26:28,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:28,573 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:28,573 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:26:28,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:26:28,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:26:28,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:26:28,574 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2018-09-26 08:26:28,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:28,613 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-09-26 08:26:28,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:26:28,613 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-09-26 08:26:28,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:28,614 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:26:28,614 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:26:28,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 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:26:28,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:26:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:26:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:26:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-09-26 08:26:28,636 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 48 [2018-09-26 08:26:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:28,636 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-09-26 08:26:28,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:26:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-09-26 08:26:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:26:28,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:28,637 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1] [2018-09-26 08:26:28,637 INFO L423 AbstractCegarLoop]: === Iteration 67 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:28,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:28,638 INFO L82 PathProgramCache]: Analyzing trace with hash 590536967, now seen corresponding path program 64 times [2018-09-26 08:26:28,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:28,740 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:26:28,741 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:28,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:26:28,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:26:28,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:26:28,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:26:28,742 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 25 states. [2018-09-26 08:26:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:28,934 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-09-26 08:26:28,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:26:28,934 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-09-26 08:26:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:28,935 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:26:28,935 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:26:28,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:26:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:26:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-09-26 08:26:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:26:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-09-26 08:26:28,961 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2018-09-26 08:26:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:28,961 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-09-26 08:26:28,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:26:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-09-26 08:26:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:26:28,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:28,962 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2018-09-26 08:26:28,962 INFO L423 AbstractCegarLoop]: === Iteration 68 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:28,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:28,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1126715271, now seen corresponding path program 65 times [2018-09-26 08:26:28,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:29,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:29,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:26:29,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:26:29,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:26:29,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:26:29,031 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-09-26 08:26:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:29,110 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-09-26 08:26:29,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:26:29,110 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-09-26 08:26:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:29,111 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:26:29,111 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:26:29,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:26:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:26:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:26:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:26:29,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-26 08:26:29,134 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 50 [2018-09-26 08:26:29,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:29,134 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-26 08:26:29,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:26:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-26 08:26:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:26:29,135 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:29,135 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2018-09-26 08:26:29,136 INFO L423 AbstractCegarLoop]: === Iteration 69 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:29,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1933230253, now seen corresponding path program 66 times [2018-09-26 08:26:29,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:29,205 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:29,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:26:29,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:26:29,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:26:29,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:26:29,206 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-09-26 08:26:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:29,251 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-09-26 08:26:29,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:26:29,252 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-09-26 08:26:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:29,253 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:26:29,253 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:26:29,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 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:26:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:26:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:26:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:26:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-09-26 08:26:29,282 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-09-26 08:26:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:29,283 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-09-26 08:26:29,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:26:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-09-26 08:26:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:26:29,284 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:29,284 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1] [2018-09-26 08:26:29,284 INFO L423 AbstractCegarLoop]: === Iteration 70 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:29,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:29,285 INFO L82 PathProgramCache]: Analyzing trace with hash -199465823, now seen corresponding path program 67 times [2018-09-26 08:26:29,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:29,415 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:26:29,415 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:29,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:26:29,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:26:29,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:26:29,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:26:29,417 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 26 states. [2018-09-26 08:26:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:29,646 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-09-26 08:26:29,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:26:29,646 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2018-09-26 08:26:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:29,647 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:26:29,647 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:26:29,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:26:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:26:29,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2018-09-26 08:26:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:26:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-09-26 08:26:29,677 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 51 [2018-09-26 08:26:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:29,677 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-09-26 08:26:29,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:26:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-09-26 08:26:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:26:29,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:29,678 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2018-09-26 08:26:29,678 INFO L423 AbstractCegarLoop]: === Iteration 71 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:29,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:29,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1888534739, now seen corresponding path program 68 times [2018-09-26 08:26:29,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:29,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:29,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:26:29,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:26:29,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:26:29,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:26:29,759 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 27 states. [2018-09-26 08:26:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:29,854 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-09-26 08:26:29,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:26:29,854 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-09-26 08:26:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:29,855 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:26:29,855 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:26:29,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:26:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:26:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:26:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:26:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-09-26 08:26:29,916 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 52 [2018-09-26 08:26:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:29,917 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-09-26 08:26:29,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:26:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-09-26 08:26:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:26:29,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:29,918 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2018-09-26 08:26:29,918 INFO L423 AbstractCegarLoop]: === Iteration 72 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:29,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:29,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1638593223, now seen corresponding path program 69 times [2018-09-26 08:26:29,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:29,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:29,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:26:29,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:26:29,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:26:29,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:26:29,987 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2018-09-26 08:26:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:30,026 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-09-26 08:26:30,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:26:30,026 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-09-26 08:26:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:30,027 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:26:30,027 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:26:30,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 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:26:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:26:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:26:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:26:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-09-26 08:26:30,052 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 52 [2018-09-26 08:26:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:30,052 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-09-26 08:26:30,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:26:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-09-26 08:26:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:26:30,053 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:30,053 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1] [2018-09-26 08:26:30,054 INFO L423 AbstractCegarLoop]: === Iteration 73 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:30,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:30,054 INFO L82 PathProgramCache]: Analyzing trace with hash -743279161, now seen corresponding path program 70 times [2018-09-26 08:26:30,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:30,156 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:26:30,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:30,156 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:26:30,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:26:30,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:26:30,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:26:30,157 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 27 states. [2018-09-26 08:26:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:30,367 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-09-26 08:26:30,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:26:30,367 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2018-09-26 08:26:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:30,368 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:26:30,368 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:26:30,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:26:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:26:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2018-09-26 08:26:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:26:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-09-26 08:26:30,396 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 53 [2018-09-26 08:26:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:30,397 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-09-26 08:26:30,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:26:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-09-26 08:26:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:26:30,398 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:30,398 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2018-09-26 08:26:30,398 INFO L423 AbstractCegarLoop]: === Iteration 74 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:30,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:30,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1566879033, now seen corresponding path program 71 times [2018-09-26 08:26:30,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:30,460 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:30,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:26:30,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:26:30,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:26:30,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:26:30,461 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 28 states. [2018-09-26 08:26:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:30,547 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-09-26 08:26:30,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:26:30,548 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-09-26 08:26:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:30,548 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:26:30,548 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:26:30,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:26:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:26:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:26:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:26:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-26 08:26:30,573 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 54 [2018-09-26 08:26:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:30,574 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-26 08:26:30,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:26:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-26 08:26:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:26:30,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:30,575 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2018-09-26 08:26:30,575 INFO L423 AbstractCegarLoop]: === Iteration 75 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:30,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:30,575 INFO L82 PathProgramCache]: Analyzing trace with hash 399905389, now seen corresponding path program 72 times [2018-09-26 08:26:30,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:30,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:30,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:26:30,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:26:30,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:26:30,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:26:30,646 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-09-26 08:26:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:30,686 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-09-26 08:26:30,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:26:30,687 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-09-26 08:26:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:30,687 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:26:30,688 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:26:30,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 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:26:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:26:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:26:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:26:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-09-26 08:26:30,712 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2018-09-26 08:26:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:30,712 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-09-26 08:26:30,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:26:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-09-26 08:26:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:26:30,713 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:30,713 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1] [2018-09-26 08:26:30,714 INFO L423 AbstractCegarLoop]: === Iteration 76 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:30,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:30,714 INFO L82 PathProgramCache]: Analyzing trace with hash -487896351, now seen corresponding path program 73 times [2018-09-26 08:26:30,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:30,818 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:26:30,818 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:30,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:26:30,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:26:30,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:26:30,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:26:30,819 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 28 states. [2018-09-26 08:26:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:31,031 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-09-26 08:26:31,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:26:31,031 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2018-09-26 08:26:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:31,032 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:26:31,032 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:26:31,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:26:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:26:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 58. [2018-09-26 08:26:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:26:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-09-26 08:26:31,059 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 55 [2018-09-26 08:26:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:31,060 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-09-26 08:26:31,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:26:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-09-26 08:26:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:26:31,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:31,061 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2018-09-26 08:26:31,061 INFO L423 AbstractCegarLoop]: === Iteration 77 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:31,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:31,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2055020781, now seen corresponding path program 74 times [2018-09-26 08:26:31,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:31,126 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:31,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:26:31,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:26:31,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:26:31,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:26:31,127 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 29 states. [2018-09-26 08:26:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:31,221 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-09-26 08:26:31,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:26:31,222 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-09-26 08:26:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:31,222 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:26:31,222 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:26:31,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:26:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:26:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:26:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:26:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-09-26 08:26:31,249 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 56 [2018-09-26 08:26:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:31,249 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-09-26 08:26:31,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:26:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-09-26 08:26:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:26:31,250 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:31,250 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2018-09-26 08:26:31,250 INFO L423 AbstractCegarLoop]: === Iteration 78 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:31,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:31,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1399171577, now seen corresponding path program 75 times [2018-09-26 08:26:31,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:31,317 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:31,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:26:31,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:26:31,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:26:31,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:26:31,318 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2018-09-26 08:26:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:31,360 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-09-26 08:26:31,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:26:31,360 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-09-26 08:26:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:31,361 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:26:31,361 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:26:31,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 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:26:31,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:26:31,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:26:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:26:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-09-26 08:26:31,386 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2018-09-26 08:26:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:31,386 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-09-26 08:26:31,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:26:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-09-26 08:26:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:26:31,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:31,387 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1] [2018-09-26 08:26:31,387 INFO L423 AbstractCegarLoop]: === Iteration 79 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:31,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:31,388 INFO L82 PathProgramCache]: Analyzing trace with hash -424707449, now seen corresponding path program 76 times [2018-09-26 08:26:31,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:31,503 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:26:31,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:31,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:26:31,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:26:31,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:26:31,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:26:31,504 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 29 states. [2018-09-26 08:26:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:31,716 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-09-26 08:26:31,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:26:31,717 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2018-09-26 08:26:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:31,717 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:26:31,717 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:26:31,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:26:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:26:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-09-26 08:26:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:26:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-09-26 08:26:31,746 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 57 [2018-09-26 08:26:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:31,747 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-09-26 08:26:31,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:26:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-09-26 08:26:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:26:31,747 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:31,748 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2018-09-26 08:26:31,748 INFO L423 AbstractCegarLoop]: === Iteration 80 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:31,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash -281090553, now seen corresponding path program 77 times [2018-09-26 08:26:31,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:31,815 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:31,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:26:31,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:26:31,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:26:31,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:26:31,816 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 30 states. [2018-09-26 08:26:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:31,916 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-09-26 08:26:31,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:26:31,916 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-09-26 08:26:31,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:31,917 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:26:31,917 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:26:31,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:26:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:26:31,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:26:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:26:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-26 08:26:31,946 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 58 [2018-09-26 08:26:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:31,946 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-26 08:26:31,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:26:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-26 08:26:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:26:31,947 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:31,947 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2018-09-26 08:26:31,948 INFO L423 AbstractCegarLoop]: === Iteration 81 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:31,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash 13128749, now seen corresponding path program 78 times [2018-09-26 08:26:31,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:32,024 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:32,024 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:26:32,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:26:32,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:26:32,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:26:32,025 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-09-26 08:26:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:32,070 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-09-26 08:26:32,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:26:32,070 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-09-26 08:26:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:32,071 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:26:32,071 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:26:32,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 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:26:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:26:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:26:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:26:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-09-26 08:26:32,098 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2018-09-26 08:26:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:32,098 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-09-26 08:26:32,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:26:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-09-26 08:26:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:26:32,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:32,099 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1] [2018-09-26 08:26:32,099 INFO L423 AbstractCegarLoop]: === Iteration 82 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:32,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:32,100 INFO L82 PathProgramCache]: Analyzing trace with hash 406929697, now seen corresponding path program 79 times [2018-09-26 08:26:32,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:32,206 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:26:32,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:32,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:26:32,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:26:32,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:26:32,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:26:32,208 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 30 states. [2018-09-26 08:26:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:32,447 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-09-26 08:26:32,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:26:32,447 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 59 [2018-09-26 08:26:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:32,448 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:26:32,448 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:26:32,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:26:32,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:26:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2018-09-26 08:26:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:26:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-09-26 08:26:32,487 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 59 [2018-09-26 08:26:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:32,487 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-09-26 08:26:32,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:26:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-09-26 08:26:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:26:32,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:32,489 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2018-09-26 08:26:32,489 INFO L423 AbstractCegarLoop]: === Iteration 83 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:32,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:32,489 INFO L82 PathProgramCache]: Analyzing trace with hash -270142803, now seen corresponding path program 80 times [2018-09-26 08:26:32,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:32,581 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:32,581 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:26:32,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:26:32,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:26:32,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:26:32,582 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 31 states. [2018-09-26 08:26:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:32,697 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-09-26 08:26:32,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:26:32,697 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-09-26 08:26:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:32,698 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:26:32,698 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:26:32,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:26:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:26:32,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:26:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:26:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-26 08:26:32,733 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 60 [2018-09-26 08:26:32,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:32,733 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-26 08:26:32,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:26:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-26 08:26:32,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:26:32,734 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:32,735 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2018-09-26 08:26:32,735 INFO L423 AbstractCegarLoop]: === Iteration 84 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:32,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:32,735 INFO L82 PathProgramCache]: Analyzing trace with hash 260720967, now seen corresponding path program 81 times [2018-09-26 08:26:32,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:32,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:32,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:26:32,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:26:32,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:26:32,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:26:32,832 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2018-09-26 08:26:32,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:32,932 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-09-26 08:26:32,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:26:32,933 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-09-26 08:26:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:32,933 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:26:32,934 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:26:32,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 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:26:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:26:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:26:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:26:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-09-26 08:26:32,963 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 60 [2018-09-26 08:26:32,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:32,963 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-09-26 08:26:32,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:26:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-09-26 08:26:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:26:32,964 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:32,964 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1] [2018-09-26 08:26:32,964 INFO L423 AbstractCegarLoop]: === Iteration 85 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:32,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:32,965 INFO L82 PathProgramCache]: Analyzing trace with hash -507646137, now seen corresponding path program 82 times [2018-09-26 08:26:32,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:33,080 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:26:33,081 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:33,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:26:33,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:26:33,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:26:33,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:26:33,082 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 31 states. [2018-09-26 08:26:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:33,333 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-09-26 08:26:33,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:26:33,333 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2018-09-26 08:26:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:33,334 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:26:33,334 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:26:33,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:26:33,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:26:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-09-26 08:26:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:26:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-09-26 08:26:33,369 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 61 [2018-09-26 08:26:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:33,369 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-09-26 08:26:33,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:26:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-09-26 08:26:33,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:26:33,370 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:33,370 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2018-09-26 08:26:33,370 INFO L423 AbstractCegarLoop]: === Iteration 86 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:33,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:33,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1442777415, now seen corresponding path program 83 times [2018-09-26 08:26:33,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:33,438 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:33,438 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:26:33,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:26:33,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:26:33,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:26:33,439 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 32 states. [2018-09-26 08:26:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:33,535 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-09-26 08:26:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:26:33,535 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-09-26 08:26:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:33,536 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:26:33,536 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:26:33,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:26:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:26:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:26:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:26:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-26 08:26:33,566 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 62 [2018-09-26 08:26:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:33,566 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-26 08:26:33,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:26:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-26 08:26:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:26:33,567 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:33,567 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2018-09-26 08:26:33,567 INFO L423 AbstractCegarLoop]: === Iteration 87 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:33,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash 719685101, now seen corresponding path program 84 times [2018-09-26 08:26:33,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:33,635 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:33,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:26:33,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:26:33,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:26:33,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:26:33,636 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-09-26 08:26:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:33,681 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-09-26 08:26:33,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:26:33,681 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-09-26 08:26:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:33,682 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:26:33,682 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:26:33,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 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:26:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:26:33,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:26:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:26:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-09-26 08:26:33,712 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-09-26 08:26:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:33,712 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-09-26 08:26:33,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:26:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-09-26 08:26:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:26:33,713 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:33,713 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1] [2018-09-26 08:26:33,713 INFO L423 AbstractCegarLoop]: === Iteration 88 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:33,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:33,713 INFO L82 PathProgramCache]: Analyzing trace with hash 835340129, now seen corresponding path program 85 times [2018-09-26 08:26:33,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:33,819 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:26:33,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:33,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:26:33,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:26:33,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:26:33,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:26:33,820 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 32 states. [2018-09-26 08:26:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:34,046 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-09-26 08:26:34,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:26:34,047 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 63 [2018-09-26 08:26:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:34,048 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:26:34,048 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:26:34,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:26:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:26:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 66. [2018-09-26 08:26:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:26:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-09-26 08:26:34,083 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 63 [2018-09-26 08:26:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:34,083 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-09-26 08:26:34,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:26:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-09-26 08:26:34,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:26:34,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:34,084 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2018-09-26 08:26:34,084 INFO L423 AbstractCegarLoop]: === Iteration 89 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:34,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash 125678701, now seen corresponding path program 86 times [2018-09-26 08:26:34,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:34,151 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:34,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:26:34,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:26:34,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:26:34,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:26:34,153 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 33 states. [2018-09-26 08:26:34,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:34,266 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-09-26 08:26:34,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:26:34,266 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-09-26 08:26:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:34,267 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:26:34,267 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:26:34,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:26:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:26:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:26:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:26:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-09-26 08:26:34,303 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 64 [2018-09-26 08:26:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:34,304 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-09-26 08:26:34,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:26:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-09-26 08:26:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:26:34,305 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:34,305 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2018-09-26 08:26:34,305 INFO L423 AbstractCegarLoop]: === Iteration 90 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:34,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:34,306 INFO L82 PathProgramCache]: Analyzing trace with hash -815346553, now seen corresponding path program 87 times [2018-09-26 08:26:34,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:34,383 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:34,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:26:34,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:26:34,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:26:34,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:26:34,384 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2018-09-26 08:26:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:34,439 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-09-26 08:26:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:26:34,439 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-09-26 08:26:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:34,440 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:26:34,440 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:26:34,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 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:26:34,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:26:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:26:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:26:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-09-26 08:26:34,473 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 64 [2018-09-26 08:26:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:34,473 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-09-26 08:26:34,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:26:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-09-26 08:26:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:26:34,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:34,474 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1] [2018-09-26 08:26:34,475 INFO L423 AbstractCegarLoop]: === Iteration 91 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:34,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:34,475 INFO L82 PathProgramCache]: Analyzing trace with hash 493999111, now seen corresponding path program 88 times [2018-09-26 08:26:34,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:34,587 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:26:34,588 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:34,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:26:34,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:26:34,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:26:34,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:26:34,589 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 33 states. [2018-09-26 08:26:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:34,837 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-09-26 08:26:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:26:34,838 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 65 [2018-09-26 08:26:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:34,838 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:26:34,839 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:26:34,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:26:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:26:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2018-09-26 08:26:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:26:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-09-26 08:26:34,877 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 65 [2018-09-26 08:26:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:34,878 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-09-26 08:26:34,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:26:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-09-26 08:26:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:26:34,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:34,879 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2018-09-26 08:26:34,879 INFO L423 AbstractCegarLoop]: === Iteration 92 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:34,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:34,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1865958265, now seen corresponding path program 89 times [2018-09-26 08:26:34,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:34,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:34,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:26:34,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:26:34,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:26:34,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:26:34,959 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 34 states. [2018-09-26 08:26:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:35,076 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-09-26 08:26:35,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:26:35,078 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-09-26 08:26:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:35,079 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:26:35,079 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:26:35,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:26:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:26:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:26:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:26:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-26 08:26:35,113 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 66 [2018-09-26 08:26:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:35,113 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-26 08:26:35,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:26:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-26 08:26:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:26:35,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:35,114 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2018-09-26 08:26:35,114 INFO L423 AbstractCegarLoop]: === Iteration 93 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:35,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:35,115 INFO L82 PathProgramCache]: Analyzing trace with hash -972970067, now seen corresponding path program 90 times [2018-09-26 08:26:35,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:35,193 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:35,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:26:35,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:26:35,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:26:35,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:26:35,194 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-09-26 08:26:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:35,244 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-09-26 08:26:35,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:26:35,244 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-09-26 08:26:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:35,245 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:26:35,245 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:26:35,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 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:26:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:26:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:26:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:26:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-09-26 08:26:35,277 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2018-09-26 08:26:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:35,277 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-09-26 08:26:35,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:26:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-09-26 08:26:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:26:35,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:35,278 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1] [2018-09-26 08:26:35,278 INFO L423 AbstractCegarLoop]: === Iteration 94 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:35,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:35,279 INFO L82 PathProgramCache]: Analyzing trace with hash -97362527, now seen corresponding path program 91 times [2018-09-26 08:26:35,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:35,398 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:26:35,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:35,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:26:35,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:26:35,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:26:35,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:26:35,399 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 34 states. [2018-09-26 08:26:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:35,689 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-09-26 08:26:35,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:26:35,689 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-09-26 08:26:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:35,690 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:26:35,690 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:26:35,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:26:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:26:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2018-09-26 08:26:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:26:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-09-26 08:26:35,734 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 67 [2018-09-26 08:26:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:35,734 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-09-26 08:26:35,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:26:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-09-26 08:26:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:26:35,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:35,735 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2018-09-26 08:26:35,736 INFO L423 AbstractCegarLoop]: === Iteration 95 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:35,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:35,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1276667437, now seen corresponding path program 92 times [2018-09-26 08:26:35,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:35,810 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:35,811 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:26:35,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:26:35,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:26:35,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:26:35,812 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 35 states. [2018-09-26 08:26:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:35,940 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-09-26 08:26:35,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:26:35,940 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-09-26 08:26:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:35,941 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:26:35,941 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:26:35,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:26:35,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:26:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:26:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:26:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-09-26 08:26:35,979 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 68 [2018-09-26 08:26:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:35,979 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-09-26 08:26:35,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:26:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-09-26 08:26:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:26:35,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:35,980 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2018-09-26 08:26:35,980 INFO L423 AbstractCegarLoop]: === Iteration 96 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:35,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:35,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1105469497, now seen corresponding path program 93 times [2018-09-26 08:26:35,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:36,058 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:36,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:26:36,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:26:36,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:26:36,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:26:36,059 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2018-09-26 08:26:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:36,115 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-09-26 08:26:36,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:26:36,115 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-09-26 08:26:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:36,116 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:26:36,116 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:26:36,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 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:26:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:26:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:26:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:26:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-09-26 08:26:36,152 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2018-09-26 08:26:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:36,153 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-09-26 08:26:36,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:26:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-09-26 08:26:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:26:36,154 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:36,154 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1] [2018-09-26 08:26:36,154 INFO L423 AbstractCegarLoop]: === Iteration 97 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:36,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash 90122439, now seen corresponding path program 94 times [2018-09-26 08:26:36,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:36,270 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:26:36,270 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:36,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:26:36,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:26:36,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:26:36,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:26:36,271 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 35 states. [2018-09-26 08:26:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:36,510 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-09-26 08:26:36,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:26:36,510 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 69 [2018-09-26 08:26:36,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:36,511 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:26:36,511 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:26:36,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:26:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:26:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2018-09-26 08:26:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:26:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-09-26 08:26:36,552 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 69 [2018-09-26 08:26:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:36,553 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-09-26 08:26:36,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:26:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-09-26 08:26:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:26:36,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:36,554 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2018-09-26 08:26:36,554 INFO L423 AbstractCegarLoop]: === Iteration 98 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:36,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:36,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1501233209, now seen corresponding path program 95 times [2018-09-26 08:26:36,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:36,627 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:36,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:26:36,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:26:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:26:36,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:26:36,628 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 36 states. [2018-09-26 08:26:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:36,757 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-09-26 08:26:36,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:26:36,757 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-09-26 08:26:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:36,758 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:26:36,758 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:26:36,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:26:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:26:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:26:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:26:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-26 08:26:36,799 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 70 [2018-09-26 08:26:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:36,800 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-26 08:26:36,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:26:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-26 08:26:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:26:36,800 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:36,801 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2018-09-26 08:26:36,801 INFO L423 AbstractCegarLoop]: === Iteration 99 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:36,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:36,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1961933165, now seen corresponding path program 96 times [2018-09-26 08:26:36,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:36,887 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:36,887 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:26:36,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:26:36,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:26:36,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:26:36,888 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-09-26 08:26:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:36,949 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-09-26 08:26:36,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:26:36,949 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-09-26 08:26:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:36,950 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:26:36,950 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:26:36,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 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:26:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:26:36,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:26:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:26:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-09-26 08:26:36,995 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2018-09-26 08:26:36,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:36,995 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-09-26 08:26:36,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:26:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-09-26 08:26:36,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:26:36,996 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:36,996 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1] [2018-09-26 08:26:36,997 INFO L423 AbstractCegarLoop]: === Iteration 100 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:36,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:36,997 INFO L82 PathProgramCache]: Analyzing trace with hash 690324449, now seen corresponding path program 97 times [2018-09-26 08:26:36,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:37,133 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:26:37,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:37,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:26:37,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:26:37,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:26:37,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:26:37,135 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 36 states. [2018-09-26 08:26:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:37,417 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-09-26 08:26:37,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:26:37,418 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 71 [2018-09-26 08:26:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:37,419 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:26:37,419 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:26:37,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:26:37,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:26:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 74. [2018-09-26 08:26:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:26:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-09-26 08:26:37,461 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 71 [2018-09-26 08:26:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:37,461 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-09-26 08:26:37,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:26:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-09-26 08:26:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:26:37,462 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:37,462 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2018-09-26 08:26:37,463 INFO L423 AbstractCegarLoop]: === Iteration 101 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:37,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:37,463 INFO L82 PathProgramCache]: Analyzing trace with hash -74840083, now seen corresponding path program 98 times [2018-09-26 08:26:37,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:37,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:37,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:26:37,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:26:37,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:26:37,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:26:37,550 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 37 states. [2018-09-26 08:26:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:37,662 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-09-26 08:26:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:26:37,662 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-09-26 08:26:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:37,663 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:26:37,663 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:26:37,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:26:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:26:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:26:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:26:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-09-26 08:26:37,705 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 72 [2018-09-26 08:26:37,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:37,705 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-09-26 08:26:37,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:26:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-09-26 08:26:37,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:26:37,706 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:37,706 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2018-09-26 08:26:37,706 INFO L423 AbstractCegarLoop]: === Iteration 102 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:37,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash -90864889, now seen corresponding path program 99 times [2018-09-26 08:26:37,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:37,799 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:37,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:26:37,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:26:37,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:26:37,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:26:37,800 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2018-09-26 08:26:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:37,864 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-09-26 08:26:37,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:26:37,865 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-09-26 08:26:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:37,865 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:26:37,866 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:26:37,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 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:26:37,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:26:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:26:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:26:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-09-26 08:26:37,914 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 72 [2018-09-26 08:26:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:37,914 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-09-26 08:26:37,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:26:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-09-26 08:26:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:26:37,915 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:37,915 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1] [2018-09-26 08:26:37,915 INFO L423 AbstractCegarLoop]: === Iteration 103 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:37,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:37,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1478094215, now seen corresponding path program 100 times [2018-09-26 08:26:37,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:38,091 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:26:38,092 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:38,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:26:38,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:26:38,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:26:38,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:26:38,093 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 37 states. [2018-09-26 08:26:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:38,405 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-09-26 08:26:38,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:26:38,406 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 73 [2018-09-26 08:26:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:38,407 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:26:38,407 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:26:38,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:26:38,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:26:38,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2018-09-26 08:26:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:26:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-09-26 08:26:38,466 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 73 [2018-09-26 08:26:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:38,466 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-09-26 08:26:38,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:26:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-09-26 08:26:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:26:38,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:38,468 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2018-09-26 08:26:38,468 INFO L423 AbstractCegarLoop]: === Iteration 104 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:38,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1423781113, now seen corresponding path program 101 times [2018-09-26 08:26:38,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:38,613 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:38,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:26:38,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:26:38,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:26:38,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:26:38,614 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 38 states. [2018-09-26 08:26:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:38,747 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-09-26 08:26:38,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:26:38,747 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-09-26 08:26:38,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:38,748 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:26:38,748 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:26:38,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:26:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:26:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:26:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:26:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-26 08:26:38,794 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 74 [2018-09-26 08:26:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:38,794 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-26 08:26:38,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:26:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-26 08:26:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:26:38,795 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:38,795 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2018-09-26 08:26:38,795 INFO L423 AbstractCegarLoop]: === Iteration 105 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:38,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:38,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1920550099, now seen corresponding path program 102 times [2018-09-26 08:26:38,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:38,888 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:38,888 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:26:38,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:26:38,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:26:38,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:26:38,889 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-09-26 08:26:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:38,950 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-09-26 08:26:38,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:26:38,950 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-09-26 08:26:38,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:38,951 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:26:38,951 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:26:38,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:26:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:26:38,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:26:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:26:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-09-26 08:26:38,998 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-09-26 08:26:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:38,999 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-09-26 08:26:38,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:26:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-09-26 08:26:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:26:39,000 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:39,000 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1] [2018-09-26 08:26:39,000 INFO L423 AbstractCegarLoop]: === Iteration 106 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:39,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:39,000 INFO L82 PathProgramCache]: Analyzing trace with hash 592427553, now seen corresponding path program 103 times [2018-09-26 08:26:39,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:39,151 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:26:39,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:39,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:26:39,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:26:39,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:26:39,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:26:39,153 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 38 states. [2018-09-26 08:26:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:39,484 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-09-26 08:26:39,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:26:39,484 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 75 [2018-09-26 08:26:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:39,485 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:26:39,485 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:26:39,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:26:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:26:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 78. [2018-09-26 08:26:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:26:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-09-26 08:26:39,544 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 75 [2018-09-26 08:26:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:39,545 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-09-26 08:26:39,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:26:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-09-26 08:26:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:26:39,546 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:39,546 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2018-09-26 08:26:39,546 INFO L423 AbstractCegarLoop]: === Iteration 107 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:39,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:39,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1185323437, now seen corresponding path program 104 times [2018-09-26 08:26:39,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:39,644 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:39,644 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:26:39,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:26:39,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:26:39,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:26:39,645 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 39 states. [2018-09-26 08:26:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:39,803 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-09-26 08:26:39,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:26:39,803 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-09-26 08:26:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:39,804 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:26:39,804 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:26:39,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:26:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:26:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:26:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:26:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-26 08:26:39,855 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 76 [2018-09-26 08:26:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:39,855 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-26 08:26:39,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:26:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-26 08:26:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:26:39,856 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:39,856 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2018-09-26 08:26:39,857 INFO L423 AbstractCegarLoop]: === Iteration 108 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:39,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:39,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1329613241, now seen corresponding path program 105 times [2018-09-26 08:26:39,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:39,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:39,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:26:39,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:26:39,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:26:39,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:26:39,958 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2018-09-26 08:26:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:40,032 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-09-26 08:26:40,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:26:40,032 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-09-26 08:26:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:40,033 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:26:40,033 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:26:40,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 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:26:40,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:26:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:26:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:26:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-09-26 08:26:40,081 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 76 [2018-09-26 08:26:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:40,082 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-09-26 08:26:40,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:26:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-09-26 08:26:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:26:40,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:40,083 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1] [2018-09-26 08:26:40,083 INFO L423 AbstractCegarLoop]: === Iteration 109 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:40,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1731600967, now seen corresponding path program 106 times [2018-09-26 08:26:40,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:40,238 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:26:40,239 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:40,239 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:26:40,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:26:40,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:26:40,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:26:40,240 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 39 states. [2018-09-26 08:26:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:40,471 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-09-26 08:26:40,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:26:40,471 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 77 [2018-09-26 08:26:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:40,471 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:26:40,471 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:26:40,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:26:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:26:40,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2018-09-26 08:26:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:26:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-09-26 08:26:40,508 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 77 [2018-09-26 08:26:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:40,508 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-09-26 08:26:40,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:26:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-09-26 08:26:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:26:40,509 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:40,509 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2018-09-26 08:26:40,509 INFO L423 AbstractCegarLoop]: === Iteration 110 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:40,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2139960903, now seen corresponding path program 107 times [2018-09-26 08:26:40,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:40,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:40,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:40,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:26:40,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:26:40,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:26:40,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:26:40,598 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 40 states. [2018-09-26 08:26:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:40,734 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-09-26 08:26:40,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:26:40,734 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-09-26 08:26:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:40,735 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:26:40,735 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:26:40,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:26:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:26:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:26:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:26:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-26 08:26:40,791 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 78 [2018-09-26 08:26:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:40,792 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-26 08:26:40,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:26:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-26 08:26:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:26:40,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:40,793 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2018-09-26 08:26:40,793 INFO L423 AbstractCegarLoop]: === Iteration 111 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:40,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1486335213, now seen corresponding path program 108 times [2018-09-26 08:26:40,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:40,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:40,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:26:40,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:26:40,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:26:40,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:26:40,906 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-09-26 08:26:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:40,987 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-09-26 08:26:40,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:26:40,987 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-09-26 08:26:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:40,988 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:26:40,988 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:26:40,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:26:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:26:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:26:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:26:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-09-26 08:26:41,044 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2018-09-26 08:26:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:41,045 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-09-26 08:26:41,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:26:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-09-26 08:26:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:26:41,045 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:41,046 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1] [2018-09-26 08:26:41,046 INFO L423 AbstractCegarLoop]: === Iteration 112 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:41,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:41,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1168310175, now seen corresponding path program 109 times [2018-09-26 08:26:41,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:41,219 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:26:41,220 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:41,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:26:41,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:26:41,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:26:41,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:26:41,221 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 40 states. [2018-09-26 08:26:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:41,653 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-09-26 08:26:41,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:26:41,653 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 79 [2018-09-26 08:26:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:41,654 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:26:41,654 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:26:41,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:26:41,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:26:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2018-09-26 08:26:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:26:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-09-26 08:26:41,720 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 79 [2018-09-26 08:26:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:41,720 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-09-26 08:26:41,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:26:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-09-26 08:26:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:26:41,721 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:41,722 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2018-09-26 08:26:41,722 INFO L423 AbstractCegarLoop]: === Iteration 113 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:41,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:41,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1857938579, now seen corresponding path program 110 times [2018-09-26 08:26:41,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:41,826 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:41,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:26:41,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:26:41,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:26:41,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:26:41,827 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 41 states. [2018-09-26 08:26:42,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:42,002 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-09-26 08:26:42,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:26:42,003 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-09-26 08:26:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:42,003 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:26:42,003 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:26:42,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:26:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:26:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:26:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:26:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-26 08:26:42,050 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 80 [2018-09-26 08:26:42,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:42,051 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-26 08:26:42,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:26:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-26 08:26:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:26:42,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:42,052 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2018-09-26 08:26:42,052 INFO L423 AbstractCegarLoop]: === Iteration 114 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:42,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:42,052 INFO L82 PathProgramCache]: Analyzing trace with hash -645498489, now seen corresponding path program 111 times [2018-09-26 08:26:42,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:42,155 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:42,156 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:26:42,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:26:42,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:26:42,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:26:42,157 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2018-09-26 08:26:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:42,226 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-09-26 08:26:42,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:26:42,226 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-09-26 08:26:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:42,227 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:26:42,227 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:26:42,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:26:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:26:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:26:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:26:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-09-26 08:26:42,286 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2018-09-26 08:26:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:42,287 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-09-26 08:26:42,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:26:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-09-26 08:26:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:26:42,287 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:42,288 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1] [2018-09-26 08:26:42,288 INFO L423 AbstractCegarLoop]: === Iteration 115 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:42,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:42,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1464321799, now seen corresponding path program 112 times [2018-09-26 08:26:42,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:42,469 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:26:42,469 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:42,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:26:42,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:26:42,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:26:42,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:26:42,470 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 41 states. [2018-09-26 08:26:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:42,871 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-09-26 08:26:42,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:26:42,871 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 81 [2018-09-26 08:26:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:42,872 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:26:42,872 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:26:42,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:26:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:26:42,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2018-09-26 08:26:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:26:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-09-26 08:26:42,940 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 81 [2018-09-26 08:26:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:42,941 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-09-26 08:26:42,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:26:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-09-26 08:26:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:26:42,942 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:42,942 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2018-09-26 08:26:42,942 INFO L423 AbstractCegarLoop]: === Iteration 116 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:42,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1850726009, now seen corresponding path program 113 times [2018-09-26 08:26:42,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:43,053 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:43,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:26:43,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:26:43,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:26:43,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:26:43,055 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 42 states. [2018-09-26 08:26:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:43,247 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-09-26 08:26:43,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:26:43,247 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-09-26 08:26:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:43,248 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:26:43,248 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:26:43,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:26:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:26:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:26:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:26:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-26 08:26:43,312 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 82 [2018-09-26 08:26:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:43,312 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-26 08:26:43,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:26:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-26 08:26:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:26:43,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:43,313 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2018-09-26 08:26:43,313 INFO L423 AbstractCegarLoop]: === Iteration 117 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:43,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1375178413, now seen corresponding path program 114 times [2018-09-26 08:26:43,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:43,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:43,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:26:43,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:26:43,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:26:43,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:26:43,434 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-09-26 08:26:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:43,510 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-09-26 08:26:43,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:26:43,510 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-09-26 08:26:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:43,511 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:26:43,511 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:26:43,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:26:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:26:43,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:26:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:26:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-09-26 08:26:43,565 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2018-09-26 08:26:43,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:43,566 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-09-26 08:26:43,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:26:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-09-26 08:26:43,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:26:43,566 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:43,568 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1] [2018-09-26 08:26:43,568 INFO L423 AbstractCegarLoop]: === Iteration 118 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:43,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:43,568 INFO L82 PathProgramCache]: Analyzing trace with hash -319203679, now seen corresponding path program 115 times [2018-09-26 08:26:43,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:43,746 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:26:43,746 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:43,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:26:43,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:26:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:26:43,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:26:43,747 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 42 states. [2018-09-26 08:26:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:44,072 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-09-26 08:26:44,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:26:44,072 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 83 [2018-09-26 08:26:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:44,072 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:26:44,073 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:26:44,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:26:44,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:26:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 86. [2018-09-26 08:26:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:26:44,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-09-26 08:26:44,123 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 83 [2018-09-26 08:26:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:44,123 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-09-26 08:26:44,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:26:44,124 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-09-26 08:26:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:26:44,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:44,124 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2018-09-26 08:26:44,125 INFO L423 AbstractCegarLoop]: === Iteration 119 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:44,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:44,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1305440979, now seen corresponding path program 116 times [2018-09-26 08:26:44,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:44,229 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:44,229 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:26:44,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:26:44,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:26:44,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:26:44,230 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 43 states. [2018-09-26 08:26:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:44,392 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2018-09-26 08:26:44,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:26:44,392 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-09-26 08:26:44,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:44,393 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:26:44,393 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:26:44,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:26:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:26:44,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:26:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:26:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-09-26 08:26:44,448 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 84 [2018-09-26 08:26:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:44,449 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-09-26 08:26:44,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:26:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-09-26 08:26:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:26:44,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:44,450 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2018-09-26 08:26:44,450 INFO L423 AbstractCegarLoop]: === Iteration 120 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:44,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash -86651705, now seen corresponding path program 117 times [2018-09-26 08:26:44,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:44,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:44,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:26:44,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:26:44,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:26:44,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:26:44,565 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2018-09-26 08:26:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:44,659 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-09-26 08:26:44,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:26:44,659 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-09-26 08:26:44,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:44,660 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:26:44,660 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:26:44,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:26:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:26:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:26:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:26:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-09-26 08:26:44,729 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 84 [2018-09-26 08:26:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:44,730 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-09-26 08:26:44,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:26:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-09-26 08:26:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:26:44,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:44,731 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1] [2018-09-26 08:26:44,731 INFO L423 AbstractCegarLoop]: === Iteration 121 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:44,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1608702919, now seen corresponding path program 118 times [2018-09-26 08:26:44,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:44,975 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:26:44,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:44,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:26:44,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:26:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:26:44,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:26:44,977 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 43 states. [2018-09-26 08:26:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:45,516 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-09-26 08:26:45,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:26:45,517 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 85 [2018-09-26 08:26:45,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:45,517 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:26:45,517 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:26:45,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:26:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:26:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2018-09-26 08:26:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:26:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-09-26 08:26:45,581 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 85 [2018-09-26 08:26:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:45,581 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-09-26 08:26:45,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:26:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-09-26 08:26:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:26:45,582 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:45,582 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2018-09-26 08:26:45,582 INFO L423 AbstractCegarLoop]: === Iteration 122 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:45,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1669878585, now seen corresponding path program 119 times [2018-09-26 08:26:45,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:45,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:45,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:26:45,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:26:45,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:26:45,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:26:45,695 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 44 states. [2018-09-26 08:26:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:45,857 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-09-26 08:26:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:26:45,857 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-09-26 08:26:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:45,858 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:26:45,858 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:26:45,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:26:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:26:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:26:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:26:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-26 08:26:45,910 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 86 [2018-09-26 08:26:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:45,911 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-26 08:26:45,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:26:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-26 08:26:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:26:45,911 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:45,912 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2018-09-26 08:26:45,912 INFO L423 AbstractCegarLoop]: === Iteration 123 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:45,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1752850541, now seen corresponding path program 120 times [2018-09-26 08:26:45,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:46,019 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:46,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:26:46,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:26:46,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:26:46,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:26:46,020 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-09-26 08:26:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:46,102 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-09-26 08:26:46,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:26:46,102 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-09-26 08:26:46,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:46,103 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:26:46,103 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:26:46,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:26:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:26:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:26:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:26:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-09-26 08:26:46,142 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-09-26 08:26:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:46,142 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-09-26 08:26:46,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:26:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-09-26 08:26:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:26:46,143 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:46,143 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1] [2018-09-26 08:26:46,143 INFO L423 AbstractCegarLoop]: === Iteration 124 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:46,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:46,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1496269599, now seen corresponding path program 121 times [2018-09-26 08:26:46,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:46,326 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:26:46,326 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:46,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:26:46,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:26:46,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:26:46,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:26:46,327 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 44 states. [2018-09-26 08:26:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:46,721 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-09-26 08:26:46,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:26:46,721 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 87 [2018-09-26 08:26:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:46,721 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:26:46,721 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:26:46,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:26:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:26:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2018-09-26 08:26:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:26:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-09-26 08:26:46,765 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 87 [2018-09-26 08:26:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:46,765 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-09-26 08:26:46,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:26:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-09-26 08:26:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:26:46,766 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:46,766 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2018-09-26 08:26:46,766 INFO L423 AbstractCegarLoop]: === Iteration 125 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:46,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:46,767 INFO L82 PathProgramCache]: Analyzing trace with hash 860221165, now seen corresponding path program 122 times [2018-09-26 08:26:46,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:46,853 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:46,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:26:46,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:26:46,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:26:46,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:26:46,854 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 45 states. [2018-09-26 08:26:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:47,001 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-09-26 08:26:47,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:26:47,001 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-09-26 08:26:47,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:47,002 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:26:47,002 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:26:47,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:26:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:26:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:26:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:26:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-09-26 08:26:47,042 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 88 [2018-09-26 08:26:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:47,043 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-09-26 08:26:47,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:26:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-09-26 08:26:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:26:47,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:47,044 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2018-09-26 08:26:47,044 INFO L423 AbstractCegarLoop]: === Iteration 126 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:47,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash -409358329, now seen corresponding path program 123 times [2018-09-26 08:26:47,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:47,158 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:47,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:26:47,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:26:47,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:26:47,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:26:47,159 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2018-09-26 08:26:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:47,239 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-09-26 08:26:47,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:26:47,239 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-09-26 08:26:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:47,240 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:26:47,240 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:26:47,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:26:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:26:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:26:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:26:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-09-26 08:26:47,296 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 88 [2018-09-26 08:26:47,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:47,297 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-09-26 08:26:47,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:26:47,297 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-09-26 08:26:47,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:26:47,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:47,297 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1] [2018-09-26 08:26:47,298 INFO L423 AbstractCegarLoop]: === Iteration 127 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:47,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:47,298 INFO L82 PathProgramCache]: Analyzing trace with hash 194732167, now seen corresponding path program 124 times [2018-09-26 08:26:47,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:47,479 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:26:47,479 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:47,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:26:47,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:26:47,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:26:47,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:26:47,480 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 45 states. [2018-09-26 08:26:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:47,832 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-09-26 08:26:47,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:26:47,832 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 89 [2018-09-26 08:26:47,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:47,833 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:26:47,833 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:26:47,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:26:47,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:26:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 92. [2018-09-26 08:26:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:26:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-09-26 08:26:47,895 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 89 [2018-09-26 08:26:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:47,896 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-09-26 08:26:47,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:26:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-09-26 08:26:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:26:47,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:47,897 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2018-09-26 08:26:47,897 INFO L423 AbstractCegarLoop]: === Iteration 128 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:47,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:47,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1741668359, now seen corresponding path program 125 times [2018-09-26 08:26:47,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:48,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:48,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:26:48,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:26:48,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:26:48,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:26:48,006 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 46 states. [2018-09-26 08:26:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:48,163 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-09-26 08:26:48,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:26:48,163 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-09-26 08:26:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:48,164 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:26:48,164 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:26:48,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:26:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:26:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:26:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:26:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-26 08:26:48,209 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 90 [2018-09-26 08:26:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:48,209 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-26 08:26:48,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:26:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-26 08:26:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:26:48,210 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:48,210 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2018-09-26 08:26:48,210 INFO L423 AbstractCegarLoop]: === Iteration 129 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:48,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1039409709, now seen corresponding path program 126 times [2018-09-26 08:26:48,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:48,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:48,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:26:48,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:26:48,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:26:48,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:26:48,311 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-09-26 08:26:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:48,378 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-09-26 08:26:48,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:26:48,378 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-09-26 08:26:48,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:48,378 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:26:48,378 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:26:48,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:26:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:26:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:26:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:26:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-09-26 08:26:48,451 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2018-09-26 08:26:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:48,451 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-09-26 08:26:48,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:26:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-09-26 08:26:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:26:48,452 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:48,452 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1] [2018-09-26 08:26:48,452 INFO L423 AbstractCegarLoop]: === Iteration 130 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:48,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2138098911, now seen corresponding path program 127 times [2018-09-26 08:26:48,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:48,622 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:26:48,622 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:48,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:26:48,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:26:48,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:26:48,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:26:48,623 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 46 states. [2018-09-26 08:26:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:48,932 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-09-26 08:26:48,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:26:48,932 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 91 [2018-09-26 08:26:48,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:48,933 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:26:48,933 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:26:48,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:26:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:26:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 94. [2018-09-26 08:26:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:26:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-09-26 08:26:48,976 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 91 [2018-09-26 08:26:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:48,976 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-09-26 08:26:48,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:26:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-09-26 08:26:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:26:48,976 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:48,977 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2018-09-26 08:26:48,977 INFO L423 AbstractCegarLoop]: === Iteration 131 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:48,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:48,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1856618323, now seen corresponding path program 128 times [2018-09-26 08:26:48,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:49,059 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:49,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:26:49,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:26:49,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:26:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:26:49,060 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 47 states. [2018-09-26 08:26:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:49,196 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2018-09-26 08:26:49,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:26:49,196 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-09-26 08:26:49,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:49,197 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:26:49,197 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:26:49,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:26:49,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:26:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:26:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:26:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-26 08:26:49,243 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 92 [2018-09-26 08:26:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:49,243 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-26 08:26:49,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:26:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-26 08:26:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:26:49,243 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:49,243 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2018-09-26 08:26:49,244 INFO L423 AbstractCegarLoop]: === Iteration 132 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:49,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:49,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2143167303, now seen corresponding path program 129 times [2018-09-26 08:26:49,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:49,364 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:49,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:26:49,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:26:49,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:26:49,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:26:49,365 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2018-09-26 08:26:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:49,444 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-09-26 08:26:49,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:26:49,444 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-09-26 08:26:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:49,444 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:26:49,444 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:26:49,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:26:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:26:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:26:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:26:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-09-26 08:26:49,498 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2018-09-26 08:26:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:49,498 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-09-26 08:26:49,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:26:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-09-26 08:26:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:26:49,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:49,499 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1] [2018-09-26 08:26:49,499 INFO L423 AbstractCegarLoop]: === Iteration 133 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:49,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:49,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2013615431, now seen corresponding path program 130 times [2018-09-26 08:26:49,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:49,650 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:26:49,651 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:49,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:26:49,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:26:49,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:26:49,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:26:49,652 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 47 states. [2018-09-26 08:26:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:49,966 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2018-09-26 08:26:49,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:26:49,966 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 93 [2018-09-26 08:26:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:49,966 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:26:49,966 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:26:49,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:26:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:26:50,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2018-09-26 08:26:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:26:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-09-26 08:26:50,017 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 93 [2018-09-26 08:26:50,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:50,017 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-09-26 08:26:50,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:26:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-09-26 08:26:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:26:50,018 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:50,018 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2018-09-26 08:26:50,018 INFO L423 AbstractCegarLoop]: === Iteration 134 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:50,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:50,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2002492601, now seen corresponding path program 131 times [2018-09-26 08:26:50,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:50,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:50,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:26:50,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:26:50,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:26:50,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:26:50,115 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 48 states. [2018-09-26 08:26:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:50,249 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-09-26 08:26:50,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:26:50,249 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-09-26 08:26:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:50,250 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:26:50,250 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:26:50,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:26:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:26:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:26:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:26:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-26 08:26:50,295 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 94 [2018-09-26 08:26:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:50,295 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-26 08:26:50,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:26:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-26 08:26:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:26:50,295 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:50,296 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2018-09-26 08:26:50,296 INFO L423 AbstractCegarLoop]: === Iteration 135 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:50,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:50,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1731777517, now seen corresponding path program 132 times [2018-09-26 08:26:50,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:50,392 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:50,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:26:50,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:26:50,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:26:50,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:26:50,394 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-09-26 08:26:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:50,457 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-09-26 08:26:50,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:26:50,457 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-09-26 08:26:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:50,458 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:26:50,458 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:26:50,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:26:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:26:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:26:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:26:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-09-26 08:26:50,504 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2018-09-26 08:26:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:50,504 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-09-26 08:26:50,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:26:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-09-26 08:26:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:26:50,505 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:50,505 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1] [2018-09-26 08:26:50,505 INFO L423 AbstractCegarLoop]: === Iteration 136 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:50,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:50,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2145433953, now seen corresponding path program 133 times [2018-09-26 08:26:50,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:50,709 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:26:50,709 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:50,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:26:50,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:26:50,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:26:50,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:26:50,710 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 48 states. [2018-09-26 08:26:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:51,074 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-09-26 08:26:51,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:26:51,074 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 95 [2018-09-26 08:26:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:51,075 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:26:51,075 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:26:51,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:26:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:26:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2018-09-26 08:26:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:26:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-09-26 08:26:51,130 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 95 [2018-09-26 08:26:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:51,131 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-09-26 08:26:51,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:26:51,131 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-09-26 08:26:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:26:51,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:51,131 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2018-09-26 08:26:51,131 INFO L423 AbstractCegarLoop]: === Iteration 137 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:51,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:51,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2083881581, now seen corresponding path program 134 times [2018-09-26 08:26:51,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:51,292 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:51,292 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:26:51,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:26:51,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:26:51,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:26:51,293 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 49 states. [2018-09-26 08:26:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:51,497 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-09-26 08:26:51,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:26:51,498 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-09-26 08:26:51,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:51,498 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:26:51,498 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:26:51,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:26:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:26:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:26:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:26:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-26 08:26:51,549 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 96 [2018-09-26 08:26:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:51,550 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-26 08:26:51,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:26:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-26 08:26:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:26:51,550 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:51,550 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2018-09-26 08:26:51,550 INFO L423 AbstractCegarLoop]: === Iteration 138 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:51,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:51,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1882138247, now seen corresponding path program 135 times [2018-09-26 08:26:51,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:51,647 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:51,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:26:51,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:26:51,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:26:51,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:26:51,648 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2018-09-26 08:26:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:51,716 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-09-26 08:26:51,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:26:51,716 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-09-26 08:26:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:51,717 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:26:51,717 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:26:51,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:26:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:26:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:26:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:26:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-09-26 08:26:51,763 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 96 [2018-09-26 08:26:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:51,763 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-09-26 08:26:51,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:26:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-09-26 08:26:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:26:51,764 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:51,764 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1] [2018-09-26 08:26:51,764 INFO L423 AbstractCegarLoop]: === Iteration 139 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:51,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:51,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1783318009, now seen corresponding path program 136 times [2018-09-26 08:26:51,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:51,898 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:26:51,898 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:51,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:26:51,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:26:51,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:26:51,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:26:51,899 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 49 states. [2018-09-26 08:26:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:52,230 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2018-09-26 08:26:52,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:26:52,231 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 97 [2018-09-26 08:26:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:52,231 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:26:52,231 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:26:52,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:26:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:26:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 100. [2018-09-26 08:26:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:26:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-09-26 08:26:52,284 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 97 [2018-09-26 08:26:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:52,284 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-09-26 08:26:52,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:26:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-09-26 08:26:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:26:52,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:52,285 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2018-09-26 08:26:52,285 INFO L423 AbstractCegarLoop]: === Iteration 140 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:52,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash 551655047, now seen corresponding path program 137 times [2018-09-26 08:26:52,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:52,383 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:52,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:26:52,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:26:52,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:26:52,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:26:52,384 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 50 states. [2018-09-26 08:26:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:52,547 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2018-09-26 08:26:52,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:26:52,548 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-09-26 08:26:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:52,548 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:26:52,548 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:26:52,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:26:52,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:26:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:26:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:26:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-26 08:26:52,597 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 98 [2018-09-26 08:26:52,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:52,597 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-26 08:26:52,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:26:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-26 08:26:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:26:52,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:52,598 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2018-09-26 08:26:52,598 INFO L423 AbstractCegarLoop]: === Iteration 141 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:52,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:52,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1407421011, now seen corresponding path program 138 times [2018-09-26 08:26:52,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:52,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:52,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:26:52,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:26:52,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:26:52,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:26:52,701 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-09-26 08:26:52,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:52,798 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-09-26 08:26:52,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:26:52,799 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-09-26 08:26:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:52,799 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:26:52,799 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:26:52,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:26:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:26:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:26:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:26:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-09-26 08:26:52,852 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-09-26 08:26:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:52,852 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-09-26 08:26:52,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:26:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-09-26 08:26:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:26:52,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:52,853 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1] [2018-09-26 08:26:52,853 INFO L423 AbstractCegarLoop]: === Iteration 142 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:52,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:52,853 INFO L82 PathProgramCache]: Analyzing trace with hash -680439903, now seen corresponding path program 139 times [2018-09-26 08:26:52,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:53,012 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:26:53,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:53,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:26:53,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:26:53,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:26:53,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:26:53,014 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 50 states. [2018-09-26 08:26:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:53,361 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-09-26 08:26:53,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:26:53,361 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 99 [2018-09-26 08:26:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:53,362 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:26:53,362 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:26:53,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:26:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:26:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 102. [2018-09-26 08:26:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:26:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-09-26 08:26:53,417 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 99 [2018-09-26 08:26:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:53,417 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-09-26 08:26:53,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:26:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-09-26 08:26:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:26:53,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:53,418 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2018-09-26 08:26:53,418 INFO L423 AbstractCegarLoop]: === Iteration 143 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:53,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:53,418 INFO L82 PathProgramCache]: Analyzing trace with hash 381137965, now seen corresponding path program 140 times [2018-09-26 08:26:53,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:53,517 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:53,517 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:26:53,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:26:53,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:26:53,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:26:53,518 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 51 states. [2018-09-26 08:26:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:53,684 INFO L93 Difference]: Finished difference Result 153 states and 155 transitions. [2018-09-26 08:26:53,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:26:53,685 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-09-26 08:26:53,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:53,685 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:26:53,685 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:26:53,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:26:53,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:26:53,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:26:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:26:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-09-26 08:26:53,761 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 100 [2018-09-26 08:26:53,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:53,761 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-09-26 08:26:53,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:26:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-09-26 08:26:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:26:53,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:53,762 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2018-09-26 08:26:53,762 INFO L423 AbstractCegarLoop]: === Iteration 144 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:53,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:53,763 INFO L82 PathProgramCache]: Analyzing trace with hash -220677689, now seen corresponding path program 141 times [2018-09-26 08:26:53,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:53,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:53,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:26:53,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:26:53,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:26:53,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:26:53,916 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2018-09-26 08:26:54,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:54,043 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-09-26 08:26:54,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:26:54,043 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-09-26 08:26:54,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:54,044 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:26:54,044 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:26:54,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:26:54,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:26:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-26 08:26:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:26:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-09-26 08:26:54,090 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 100 [2018-09-26 08:26:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:54,090 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-09-26 08:26:54,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:26:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-09-26 08:26:54,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:26:54,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:54,091 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1] [2018-09-26 08:26:54,091 INFO L423 AbstractCegarLoop]: === Iteration 145 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:54,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:54,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1748864711, now seen corresponding path program 142 times [2018-09-26 08:26:54,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:54,238 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:26:54,238 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:54,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:26:54,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:26:54,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:26:54,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:26:54,239 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 51 states. [2018-09-26 08:26:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:54,598 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2018-09-26 08:26:54,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:26:54,598 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 101 [2018-09-26 08:26:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:54,598 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:26:54,599 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:26:54,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:26:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:26:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 104. [2018-09-26 08:26:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:26:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-09-26 08:26:54,657 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 101 [2018-09-26 08:26:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:54,657 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-09-26 08:26:54,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:26:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-09-26 08:26:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:26:54,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:54,658 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2018-09-26 08:26:54,658 INFO L423 AbstractCegarLoop]: === Iteration 146 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:54,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:54,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1619830329, now seen corresponding path program 143 times [2018-09-26 08:26:54,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:54,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:54,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:26:54,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:26:54,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:26:54,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:26:54,761 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 52 states. [2018-09-26 08:26:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:54,935 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-09-26 08:26:54,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:26:54,936 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-09-26 08:26:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:54,936 INFO L225 Difference]: With dead ends: 156 [2018-09-26 08:26:54,936 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:26:54,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:26:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:26:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:26:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:26:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-26 08:26:55,004 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 102 [2018-09-26 08:26:55,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:55,005 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-26 08:26:55,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:26:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-26 08:26:55,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:26:55,005 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:55,005 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2018-09-26 08:26:55,005 INFO L423 AbstractCegarLoop]: === Iteration 147 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:55,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:55,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1198720877, now seen corresponding path program 144 times [2018-09-26 08:26:55,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:55,114 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:55,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:26:55,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:26:55,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:26:55,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:26:55,115 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-09-26 08:26:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:55,186 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-09-26 08:26:55,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:26:55,186 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-09-26 08:26:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:55,186 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:26:55,186 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:26:55,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:26:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:26:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:26:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:26:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-09-26 08:26:55,240 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2018-09-26 08:26:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:55,240 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-09-26 08:26:55,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:26:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-09-26 08:26:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:26:55,241 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:55,241 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1] [2018-09-26 08:26:55,242 INFO L423 AbstractCegarLoop]: === Iteration 148 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:55,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:55,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1494419999, now seen corresponding path program 145 times [2018-09-26 08:26:55,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:55,424 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:26:55,424 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:55,424 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:26:55,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:26:55,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:26:55,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:26:55,425 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 52 states. [2018-09-26 08:26:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:55,804 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2018-09-26 08:26:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:26:55,804 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 103 [2018-09-26 08:26:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:55,805 INFO L225 Difference]: With dead ends: 158 [2018-09-26 08:26:55,805 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:26:55,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:26:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:26:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 106. [2018-09-26 08:26:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:26:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-09-26 08:26:55,865 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 103 [2018-09-26 08:26:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:55,866 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-09-26 08:26:55,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:26:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-09-26 08:26:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:26:55,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:55,866 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2018-09-26 08:26:55,866 INFO L423 AbstractCegarLoop]: === Iteration 149 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:55,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:55,867 INFO L82 PathProgramCache]: Analyzing trace with hash 917558765, now seen corresponding path program 146 times [2018-09-26 08:26:55,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:55,955 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:55,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:26:55,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:26:55,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:26:55,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:26:55,956 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 53 states. [2018-09-26 08:26:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:56,119 INFO L93 Difference]: Finished difference Result 159 states and 161 transitions. [2018-09-26 08:26:56,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:26:56,119 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-09-26 08:26:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:56,120 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:26:56,120 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:26:56,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:26:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:26:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:26:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:26:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-09-26 08:26:56,178 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 104 [2018-09-26 08:26:56,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:56,179 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-09-26 08:26:56,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:26:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-09-26 08:26:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:26:56,179 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:56,179 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2018-09-26 08:26:56,179 INFO L423 AbstractCegarLoop]: === Iteration 150 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:56,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1901667065, now seen corresponding path program 147 times [2018-09-26 08:26:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:56,275 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:56,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:26:56,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:26:56,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:26:56,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:26:56,276 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2018-09-26 08:26:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:56,342 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-09-26 08:26:56,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:26:56,342 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-09-26 08:26:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:56,343 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:26:56,343 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:26:56,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:26:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:26:56,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-26 08:26:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:26:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-09-26 08:26:56,393 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2018-09-26 08:26:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:56,393 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-09-26 08:26:56,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:26:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-09-26 08:26:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:26:56,394 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:56,394 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1] [2018-09-26 08:26:56,394 INFO L423 AbstractCegarLoop]: === Iteration 151 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:56,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1177801607, now seen corresponding path program 148 times [2018-09-26 08:26:56,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:56,606 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:26:56,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:56,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:26:56,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:26:56,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:26:56,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:26:56,608 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 53 states. [2018-09-26 08:26:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:57,105 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-09-26 08:26:57,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:26:57,105 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 105 [2018-09-26 08:26:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:57,106 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:26:57,106 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:26:57,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:26:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:26:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2018-09-26 08:26:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:26:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-09-26 08:26:57,170 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 105 [2018-09-26 08:26:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:57,171 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-09-26 08:26:57,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:26:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-09-26 08:26:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:26:57,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:57,171 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2018-09-26 08:26:57,171 INFO L423 AbstractCegarLoop]: === Iteration 152 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:57,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:57,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2142917369, now seen corresponding path program 149 times [2018-09-26 08:26:57,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:57,264 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:57,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:26:57,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:26:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:26:57,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:26:57,265 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 54 states. [2018-09-26 08:26:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:57,433 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-09-26 08:26:57,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:26:57,434 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-09-26 08:26:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:57,434 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:26:57,434 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:26:57,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:26:57,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:26:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:26:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:26:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-26 08:26:57,485 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 106 [2018-09-26 08:26:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:57,485 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-26 08:26:57,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:26:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-26 08:26:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:26:57,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:57,485 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2018-09-26 08:26:57,486 INFO L423 AbstractCegarLoop]: === Iteration 153 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:57,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash 655395117, now seen corresponding path program 150 times [2018-09-26 08:26:57,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:57,587 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:57,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:26:57,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:26:57,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:26:57,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:26:57,588 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-09-26 08:26:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:57,674 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-09-26 08:26:57,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:26:57,674 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-09-26 08:26:57,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:57,674 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:26:57,675 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 08:26:57,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:26:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 08:26:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-09-26 08:26:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:26:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-09-26 08:26:57,758 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2018-09-26 08:26:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:57,759 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-09-26 08:26:57,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:26:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-09-26 08:26:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 08:26:57,759 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:57,759 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1] [2018-09-26 08:26:57,760 INFO L423 AbstractCegarLoop]: === Iteration 154 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:57,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:57,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1157649375, now seen corresponding path program 151 times [2018-09-26 08:26:57,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:58,044 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:26:58,044 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:58,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:26:58,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:26:58,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:26:58,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:26:58,045 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 54 states. [2018-09-26 08:26:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:58,468 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2018-09-26 08:26:58,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:26:58,468 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 107 [2018-09-26 08:26:58,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:58,469 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:26:58,469 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:26:58,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:26:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:26:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2018-09-26 08:26:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:26:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-09-26 08:26:58,530 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 107 [2018-09-26 08:26:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:58,530 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-09-26 08:26:58,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:26:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-09-26 08:26:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:26:58,530 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:58,530 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2018-09-26 08:26:58,531 INFO L423 AbstractCegarLoop]: === Iteration 155 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:58,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:58,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1527453779, now seen corresponding path program 152 times [2018-09-26 08:26:58,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:58,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:58,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:26:58,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:26:58,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:26:58,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:26:58,632 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 55 states. [2018-09-26 08:26:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:58,819 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2018-09-26 08:26:58,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:26:58,819 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-09-26 08:26:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:58,819 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:26:58,819 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:26:58,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:26:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:26:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:26:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:26:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-26 08:26:58,877 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 108 [2018-09-26 08:26:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:58,877 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-26 08:26:58,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:26:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-26 08:26:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:26:58,878 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:58,878 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2018-09-26 08:26:58,878 INFO L423 AbstractCegarLoop]: === Iteration 156 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:58,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:58,878 INFO L82 PathProgramCache]: Analyzing trace with hash -679112633, now seen corresponding path program 153 times [2018-09-26 08:26:58,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:58,991 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:58,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:26:58,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:26:58,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:26:58,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:26:58,992 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2018-09-26 08:26:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:59,065 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-09-26 08:26:59,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:26:59,065 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-09-26 08:26:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:59,065 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:26:59,065 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:26:59,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:26:59,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:26:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-26 08:26:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:26:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-09-26 08:26:59,118 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 108 [2018-09-26 08:26:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:59,118 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-09-26 08:26:59,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:26:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-09-26 08:26:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:26:59,119 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:59,119 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1] [2018-09-26 08:26:59,120 INFO L423 AbstractCegarLoop]: === Iteration 157 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:59,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash 422283335, now seen corresponding path program 154 times [2018-09-26 08:26:59,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:59,313 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:26:59,314 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:59,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:26:59,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:26:59,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:26:59,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:26:59,314 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 55 states. [2018-09-26 08:26:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:59,724 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-09-26 08:26:59,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:26:59,724 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 109 [2018-09-26 08:26:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:59,724 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:26:59,724 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:26:59,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:26:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:26:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 112. [2018-09-26 08:26:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:26:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-09-26 08:26:59,782 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 109 [2018-09-26 08:26:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:59,782 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-09-26 08:26:59,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:26:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-09-26 08:26:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:26:59,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:59,783 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2018-09-26 08:26:59,783 INFO L423 AbstractCegarLoop]: === Iteration 158 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:59,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:59,783 INFO L82 PathProgramCache]: Analyzing trace with hash 205819975, now seen corresponding path program 155 times [2018-09-26 08:26:59,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:59,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:59,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:26:59,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:26:59,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:26:59,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:26:59,924 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 56 states. [2018-09-26 08:27:00,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:00,095 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2018-09-26 08:27:00,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:27:00,095 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-09-26 08:27:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:00,096 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:27:00,096 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:27:00,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:27:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:27:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:27:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:27:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-26 08:27:00,150 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 110 [2018-09-26 08:27:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:00,151 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-26 08:27:00,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:27:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-26 08:27:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:27:00,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:00,151 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2018-09-26 08:27:00,151 INFO L423 AbstractCegarLoop]: === Iteration 159 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:00,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:00,151 INFO L82 PathProgramCache]: Analyzing trace with hash 734591725, now seen corresponding path program 156 times [2018-09-26 08:27:00,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:00,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:00,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:27:00,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:27:00,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:27:00,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:27:00,264 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-09-26 08:27:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:00,338 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-09-26 08:27:00,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:27:00,338 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-09-26 08:27:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:00,338 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:27:00,338 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:27:00,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:27:00,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:27:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-09-26 08:27:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:27:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-09-26 08:27:00,395 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-09-26 08:27:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:00,395 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-09-26 08:27:00,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:27:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-09-26 08:27:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:27:00,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:00,395 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1] [2018-09-26 08:27:00,396 INFO L423 AbstractCegarLoop]: === Iteration 160 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:00,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:00,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1297445473, now seen corresponding path program 157 times [2018-09-26 08:27:00,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:00,565 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:27:00,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:00,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:27:00,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:27:00,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:27:00,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:27:00,566 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 56 states. [2018-09-26 08:27:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:00,970 INFO L93 Difference]: Finished difference Result 170 states and 172 transitions. [2018-09-26 08:27:00,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:27:00,970 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 111 [2018-09-26 08:27:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:00,970 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:27:00,971 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:27:00,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:27:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:27:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2018-09-26 08:27:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:27:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-09-26 08:27:01,031 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 111 [2018-09-26 08:27:01,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:01,032 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-09-26 08:27:01,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:27:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-09-26 08:27:01,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:27:01,032 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:01,032 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2018-09-26 08:27:01,032 INFO L423 AbstractCegarLoop]: === Iteration 161 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:01,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:01,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1566042477, now seen corresponding path program 158 times [2018-09-26 08:27:01,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:01,138 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:01,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:27:01,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:27:01,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:27:01,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:27:01,139 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 57 states. [2018-09-26 08:27:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:01,353 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2018-09-26 08:27:01,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:27:01,353 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-09-26 08:27:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:01,354 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:27:01,354 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:27:01,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:27:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:27:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:27:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:27:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-09-26 08:27:01,417 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 112 [2018-09-26 08:27:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:01,418 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-09-26 08:27:01,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:27:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-09-26 08:27:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:27:01,418 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:01,419 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2018-09-26 08:27:01,419 INFO L423 AbstractCegarLoop]: === Iteration 162 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:01,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash 778097543, now seen corresponding path program 159 times [2018-09-26 08:27:01,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:01,602 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:01,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:27:01,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:27:01,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:27:01,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:27:01,603 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2018-09-26 08:27:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:01,697 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-09-26 08:27:01,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:27:01,697 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-09-26 08:27:01,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:01,698 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:27:01,698 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:27:01,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 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:27:01,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:27:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-09-26 08:27:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:27:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-09-26 08:27:01,766 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 112 [2018-09-26 08:27:01,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:01,767 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-09-26 08:27:01,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:27:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-09-26 08:27:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-26 08:27:01,767 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:01,767 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1] [2018-09-26 08:27:01,767 INFO L423 AbstractCegarLoop]: === Iteration 163 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:01,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:01,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1648841465, now seen corresponding path program 160 times [2018-09-26 08:27:01,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:01,986 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:27:01,986 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:01,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:27:01,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:27:01,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:27:01,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:27:01,987 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 57 states. [2018-09-26 08:27:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:02,494 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-09-26 08:27:02,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:27:02,494 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 113 [2018-09-26 08:27:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:02,495 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:27:02,495 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:27:02,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:27:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:27:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 116. [2018-09-26 08:27:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:27:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-09-26 08:27:02,598 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 113 [2018-09-26 08:27:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:02,598 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-09-26 08:27:02,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:27:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-09-26 08:27:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:27:02,599 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:02,599 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2018-09-26 08:27:02,599 INFO L423 AbstractCegarLoop]: === Iteration 164 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:02,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:02,600 INFO L82 PathProgramCache]: Analyzing trace with hash 425460615, now seen corresponding path program 161 times [2018-09-26 08:27:02,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:02,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:02,761 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:27:02,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:27:02,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:27:02,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:27:02,762 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 58 states. [2018-09-26 08:27:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:03,057 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2018-09-26 08:27:03,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:27:03,057 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-09-26 08:27:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:03,058 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:27:03,058 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:27:03,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:27:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:27:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:27:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:27:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-26 08:27:03,135 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 114 [2018-09-26 08:27:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:03,135 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-26 08:27:03,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:27:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-26 08:27:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:27:03,136 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:03,136 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2018-09-26 08:27:03,136 INFO L423 AbstractCegarLoop]: === Iteration 165 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:03,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1768971437, now seen corresponding path program 162 times [2018-09-26 08:27:03,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:03,313 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:03,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:27:03,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:27:03,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:27:03,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:27:03,314 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-09-26 08:27:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:03,390 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2018-09-26 08:27:03,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:27:03,390 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-09-26 08:27:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:03,391 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:27:03,391 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:27:03,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:27:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:27:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-09-26 08:27:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:27:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2018-09-26 08:27:03,452 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 114 [2018-09-26 08:27:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:03,452 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2018-09-26 08:27:03,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:27:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2018-09-26 08:27:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:27:03,453 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:03,453 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1] [2018-09-26 08:27:03,453 INFO L423 AbstractCegarLoop]: === Iteration 166 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:03,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:03,453 INFO L82 PathProgramCache]: Analyzing trace with hash -996521823, now seen corresponding path program 163 times [2018-09-26 08:27:03,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:03,640 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:27:03,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:03,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:27:03,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:27:03,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:27:03,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:27:03,641 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 58 states. [2018-09-26 08:27:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:04,095 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2018-09-26 08:27:04,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:27:04,095 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 115 [2018-09-26 08:27:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:04,096 INFO L225 Difference]: With dead ends: 176 [2018-09-26 08:27:04,096 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:27:04,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:27:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:27:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 118. [2018-09-26 08:27:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:27:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-09-26 08:27:04,160 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 115 [2018-09-26 08:27:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:04,160 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-09-26 08:27:04,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:27:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-09-26 08:27:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:27:04,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:04,160 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1] [2018-09-26 08:27:04,161 INFO L423 AbstractCegarLoop]: === Iteration 167 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:04,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:04,161 INFO L82 PathProgramCache]: Analyzing trace with hash -827466963, now seen corresponding path program 164 times [2018-09-26 08:27:04,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:04,274 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:04,274 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:27:04,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:27:04,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:27:04,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:27:04,275 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 59 states. [2018-09-26 08:27:04,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:04,490 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-09-26 08:27:04,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:27:04,490 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-09-26 08:27:04,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:04,491 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:27:04,491 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:27:04,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:27:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:27:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:27:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:27:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-09-26 08:27:04,552 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 116 [2018-09-26 08:27:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:04,553 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-09-26 08:27:04,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:27:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-09-26 08:27:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:27:04,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:04,554 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1] [2018-09-26 08:27:04,554 INFO L423 AbstractCegarLoop]: === Iteration 168 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:04,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:04,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2128304441, now seen corresponding path program 165 times [2018-09-26 08:27:04,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:04,706 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:04,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:27:04,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:27:04,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:27:04,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:27:04,707 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2018-09-26 08:27:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:04,790 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-09-26 08:27:04,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:27:04,790 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-09-26 08:27:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:04,790 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:27:04,790 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:27:04,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:27:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:27:04,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-09-26 08:27:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:27:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-09-26 08:27:04,852 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2018-09-26 08:27:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:04,852 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-09-26 08:27:04,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:27:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-09-26 08:27:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-26 08:27:04,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:04,853 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1] [2018-09-26 08:27:04,853 INFO L423 AbstractCegarLoop]: === Iteration 169 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:04,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:04,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1552989753, now seen corresponding path program 166 times [2018-09-26 08:27:04,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:05,045 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:27:05,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:05,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:27:05,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:27:05,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:27:05,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:27:05,046 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 59 states. [2018-09-26 08:27:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:05,547 INFO L93 Difference]: Finished difference Result 179 states and 181 transitions. [2018-09-26 08:27:05,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:27:05,548 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 117 [2018-09-26 08:27:05,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:05,548 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:27:05,548 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:27:05,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:27:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:27:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 120. [2018-09-26 08:27:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-09-26 08:27:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-09-26 08:27:05,614 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 117 [2018-09-26 08:27:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:05,614 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-09-26 08:27:05,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:27:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-09-26 08:27:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:27:05,615 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:05,615 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1] [2018-09-26 08:27:05,615 INFO L423 AbstractCegarLoop]: === Iteration 170 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:05,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:05,616 INFO L82 PathProgramCache]: Analyzing trace with hash -898103609, now seen corresponding path program 167 times [2018-09-26 08:27:05,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:05,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:05,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:27:05,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:27:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:27:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:27:05,754 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 60 states. [2018-09-26 08:27:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:05,963 INFO L93 Difference]: Finished difference Result 180 states and 182 transitions. [2018-09-26 08:27:05,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:27:05,963 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-09-26 08:27:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:05,963 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:27:05,963 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:27:05,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:27:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:27:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:27:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:27:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-26 08:27:06,030 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 118 [2018-09-26 08:27:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:06,030 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-26 08:27:06,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:27:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-26 08:27:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:27:06,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:06,031 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1] [2018-09-26 08:27:06,031 INFO L423 AbstractCegarLoop]: === Iteration 171 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:06,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:06,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1725607533, now seen corresponding path program 168 times [2018-09-26 08:27:06,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:06,174 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:06,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:27:06,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:27:06,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:27:06,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:27:06,175 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-09-26 08:27:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:06,291 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-09-26 08:27:06,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:27:06,291 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-09-26 08:27:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:06,292 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:27:06,292 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:27:06,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:27:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:27:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-09-26 08:27:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-09-26 08:27:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-09-26 08:27:06,357 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 118 [2018-09-26 08:27:06,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:06,357 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-09-26 08:27:06,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:27:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-09-26 08:27:06,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-26 08:27:06,358 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:06,358 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1] [2018-09-26 08:27:06,358 INFO L423 AbstractCegarLoop]: === Iteration 172 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:06,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:06,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1954164449, now seen corresponding path program 169 times [2018-09-26 08:27:06,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:06,560 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:27:06,561 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:06,561 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:27:06,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:27:06,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:27:06,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:27:06,562 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 60 states. [2018-09-26 08:27:07,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:07,100 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2018-09-26 08:27:07,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:27:07,100 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 119 [2018-09-26 08:27:07,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:07,101 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:27:07,101 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:27:07,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:27:07,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:27:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 122. [2018-09-26 08:27:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:27:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-09-26 08:27:07,175 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 119 [2018-09-26 08:27:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:07,175 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-09-26 08:27:07,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:27:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-09-26 08:27:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:27:07,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:07,176 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1] [2018-09-26 08:27:07,176 INFO L423 AbstractCegarLoop]: === Iteration 173 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:07,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:07,176 INFO L82 PathProgramCache]: Analyzing trace with hash 449494253, now seen corresponding path program 170 times [2018-09-26 08:27:07,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:07,317 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:07,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:27:07,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:27:07,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:27:07,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:27:07,317 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 61 states. [2018-09-26 08:27:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:07,569 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2018-09-26 08:27:07,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:27:07,569 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-09-26 08:27:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:07,570 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:27:07,570 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:27:07,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:27:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:27:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:27:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:27:07,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-09-26 08:27:07,640 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 120 [2018-09-26 08:27:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:07,640 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-09-26 08:27:07,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:27:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-09-26 08:27:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:27:07,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:07,641 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1] [2018-09-26 08:27:07,641 INFO L423 AbstractCegarLoop]: === Iteration 174 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:07,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash 180161031, now seen corresponding path program 171 times [2018-09-26 08:27:07,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:07,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:07,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:27:07,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:27:07,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:27:07,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:27:07,791 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2018-09-26 08:27:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:07,902 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-09-26 08:27:07,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:27:07,902 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-09-26 08:27:07,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:07,902 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:27:07,902 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:27:07,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:27:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:27:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-09-26 08:27:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:27:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-09-26 08:27:07,967 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 120 [2018-09-26 08:27:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:07,968 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-09-26 08:27:07,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:27:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-09-26 08:27:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 08:27:07,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:07,969 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1] [2018-09-26 08:27:07,969 INFO L423 AbstractCegarLoop]: === Iteration 175 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:07,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:07,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1289963143, now seen corresponding path program 172 times [2018-09-26 08:27:07,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:08,176 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:27:08,176 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:08,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:27:08,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:27:08,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:27:08,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:27:08,177 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 61 states. [2018-09-26 08:27:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:08,725 INFO L93 Difference]: Finished difference Result 185 states and 187 transitions. [2018-09-26 08:27:08,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:27:08,726 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 121 [2018-09-26 08:27:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:08,726 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:27:08,726 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 08:27:08,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:27:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 08:27:08,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 124. [2018-09-26 08:27:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:27:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-09-26 08:27:08,824 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 121 [2018-09-26 08:27:08,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:08,824 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-09-26 08:27:08,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:27:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-09-26 08:27:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:27:08,825 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:08,825 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1, 1, 1] [2018-09-26 08:27:08,825 INFO L423 AbstractCegarLoop]: === Iteration 176 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:08,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:08,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1334090247, now seen corresponding path program 173 times [2018-09-26 08:27:08,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:08,970 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:08,970 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:27:08,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:27:08,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:27:08,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:27:08,971 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 62 states. [2018-09-26 08:27:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:09,205 INFO L93 Difference]: Finished difference Result 186 states and 188 transitions. [2018-09-26 08:27:09,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:27:09,206 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-09-26 08:27:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:09,206 INFO L225 Difference]: With dead ends: 186 [2018-09-26 08:27:09,206 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:27:09,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:27:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:27:09,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:27:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:27:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-26 08:27:09,277 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 122 [2018-09-26 08:27:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:09,277 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-26 08:27:09,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:27:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-26 08:27:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:27:09,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:09,278 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1, 1, 1] [2018-09-26 08:27:09,279 INFO L423 AbstractCegarLoop]: === Iteration 177 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:09,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:09,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1574694957, now seen corresponding path program 174 times [2018-09-26 08:27:09,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:09,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:09,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:27:09,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:27:09,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:27:09,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:27:09,459 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-09-26 08:27:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:09,587 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-09-26 08:27:09,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:27:09,587 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-09-26 08:27:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:09,588 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:27:09,588 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:27:09,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:27:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:27:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-09-26 08:27:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:27:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-09-26 08:27:09,678 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2018-09-26 08:27:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:09,679 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-09-26 08:27:09,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:27:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-09-26 08:27:09,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 08:27:09,679 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:09,679 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1] [2018-09-26 08:27:09,680 INFO L423 AbstractCegarLoop]: === Iteration 178 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:09,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:09,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1570841889, now seen corresponding path program 175 times [2018-09-26 08:27:09,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:10,015 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:27:10,016 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:10,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:27:10,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:27:10,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:27:10,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:27:10,016 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 62 states. [2018-09-26 08:27:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:10,537 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2018-09-26 08:27:10,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:27:10,537 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 123 [2018-09-26 08:27:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:10,538 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:27:10,538 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:27:10,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:27:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:27:10,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 126. [2018-09-26 08:27:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:27:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-09-26 08:27:10,625 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 123 [2018-09-26 08:27:10,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:10,625 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-09-26 08:27:10,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:27:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-09-26 08:27:10,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:27:10,626 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:10,626 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1, 1, 1] [2018-09-26 08:27:10,626 INFO L423 AbstractCegarLoop]: === Iteration 179 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:10,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:10,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1451396781, now seen corresponding path program 176 times [2018-09-26 08:27:10,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:10,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:10,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:27:10,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:27:10,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:27:10,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:27:10,785 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 63 states. [2018-09-26 08:27:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:11,074 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2018-09-26 08:27:11,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:27:11,074 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-09-26 08:27:11,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:11,074 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:27:11,075 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:27:11,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:27:11,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:27:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:27:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:27:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-09-26 08:27:11,156 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 124 [2018-09-26 08:27:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:11,156 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-09-26 08:27:11,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:27:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-09-26 08:27:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:27:11,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:11,157 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1, 1, 1] [2018-09-26 08:27:11,157 INFO L423 AbstractCegarLoop]: === Iteration 180 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:11,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:11,157 INFO L82 PathProgramCache]: Analyzing trace with hash 320208199, now seen corresponding path program 177 times [2018-09-26 08:27:11,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:11,325 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:11,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:27:11,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:27:11,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:27:11,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:27:11,326 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2018-09-26 08:27:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:11,420 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-09-26 08:27:11,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:27:11,420 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-09-26 08:27:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:11,421 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:27:11,421 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 08:27:11,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:27:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 08:27:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-09-26 08:27:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:27:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-09-26 08:27:11,490 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 124 [2018-09-26 08:27:11,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:11,490 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-09-26 08:27:11,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:27:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-09-26 08:27:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 08:27:11,490 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:11,490 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1] [2018-09-26 08:27:11,490 INFO L423 AbstractCegarLoop]: === Iteration 181 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:11,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:11,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1336458055, now seen corresponding path program 178 times [2018-09-26 08:27:11,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:11,715 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:27:11,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:11,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:27:11,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:27:11,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:27:11,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:27:11,716 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 63 states. [2018-09-26 08:27:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:12,284 INFO L93 Difference]: Finished difference Result 191 states and 193 transitions. [2018-09-26 08:27:12,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:27:12,284 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 125 [2018-09-26 08:27:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:12,285 INFO L225 Difference]: With dead ends: 191 [2018-09-26 08:27:12,285 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 08:27:12,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:27:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 08:27:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 128. [2018-09-26 08:27:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:27:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-09-26 08:27:12,368 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 125 [2018-09-26 08:27:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:12,368 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-09-26 08:27:12,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:27:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-09-26 08:27:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:27:12,369 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:12,369 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1, 1, 1] [2018-09-26 08:27:12,369 INFO L423 AbstractCegarLoop]: === Iteration 182 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:12,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:12,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1519534777, now seen corresponding path program 179 times [2018-09-26 08:27:12,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:12,540 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:12,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:27:12,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:27:12,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:27:12,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:27:12,541 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 64 states. [2018-09-26 08:27:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:12,838 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2018-09-26 08:27:12,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:27:12,838 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-09-26 08:27:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:12,839 INFO L225 Difference]: With dead ends: 192 [2018-09-26 08:27:12,839 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:27:12,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:27:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:27:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:27:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:27:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-26 08:27:12,914 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 126 [2018-09-26 08:27:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:12,914 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-26 08:27:12,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:27:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-26 08:27:12,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:27:12,915 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:12,915 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1, 1, 1] [2018-09-26 08:27:12,915 INFO L423 AbstractCegarLoop]: === Iteration 183 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:12,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:12,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2068324845, now seen corresponding path program 180 times [2018-09-26 08:27:12,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:13,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:13,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:27:13,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:27:13,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:27:13,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:27:13,079 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-09-26 08:27:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:13,183 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2018-09-26 08:27:13,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:27:13,183 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-09-26 08:27:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:13,184 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:27:13,184 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:27:13,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:27:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:27:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-09-26 08:27:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:27:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2018-09-26 08:27:13,279 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 126 [2018-09-26 08:27:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:13,279 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2018-09-26 08:27:13,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:27:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2018-09-26 08:27:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-26 08:27:13,279 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:13,280 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1] [2018-09-26 08:27:13,280 INFO L423 AbstractCegarLoop]: === Iteration 184 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:13,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash -306500767, now seen corresponding path program 181 times [2018-09-26 08:27:13,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:13,570 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:27:13,570 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:13,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:27:13,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:27:13,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:27:13,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:27:13,571 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 64 states. [2018-09-26 08:27:14,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:14,173 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-09-26 08:27:14,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:27:14,173 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 127 [2018-09-26 08:27:14,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:14,173 INFO L225 Difference]: With dead ends: 194 [2018-09-26 08:27:14,173 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:27:14,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:27:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:27:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 130. [2018-09-26 08:27:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-26 08:27:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-09-26 08:27:14,260 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 127 [2018-09-26 08:27:14,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:14,260 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-09-26 08:27:14,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:27:14,260 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-09-26 08:27:14,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:27:14,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:14,260 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1, 1, 1] [2018-09-26 08:27:14,261 INFO L423 AbstractCegarLoop]: === Iteration 185 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:14,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash -911650707, now seen corresponding path program 182 times [2018-09-26 08:27:14,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:14,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:14,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:27:14,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:27:14,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:27:14,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:27:14,421 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 65 states. [2018-09-26 08:27:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:14,728 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-09-26 08:27:14,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:27:14,728 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-09-26 08:27:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:14,728 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:27:14,728 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:27:14,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:27:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:27:14,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:27:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:27:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-26 08:27:14,807 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 128 [2018-09-26 08:27:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:14,807 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-26 08:27:14,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:27:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-26 08:27:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:27:14,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:14,808 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1, 1, 1] [2018-09-26 08:27:14,808 INFO L423 AbstractCegarLoop]: === Iteration 186 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:14,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:14,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1357152121, now seen corresponding path program 183 times [2018-09-26 08:27:14,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:15,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:15,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:27:15,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:27:15,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:27:15,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:27:15,013 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2018-09-26 08:27:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:15,121 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-09-26 08:27:15,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:27:15,121 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-09-26 08:27:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:15,121 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:27:15,121 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:27:15,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:27:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:27:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-09-26 08:27:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-26 08:27:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-09-26 08:27:15,194 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2018-09-26 08:27:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:15,195 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-09-26 08:27:15,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:27:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-09-26 08:27:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-26 08:27:15,195 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:15,195 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1] [2018-09-26 08:27:15,195 INFO L423 AbstractCegarLoop]: === Iteration 187 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:15,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:15,196 INFO L82 PathProgramCache]: Analyzing trace with hash 877895687, now seen corresponding path program 184 times [2018-09-26 08:27:15,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:15,429 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:27:15,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:15,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:27:15,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:27:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:27:15,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:27:15,430 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 65 states. [2018-09-26 08:27:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:16,074 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-09-26 08:27:16,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:27:16,074 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 129 [2018-09-26 08:27:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:16,074 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:27:16,075 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 08:27:16,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:27:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 08:27:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 132. [2018-09-26 08:27:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 08:27:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-09-26 08:27:16,167 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 129 [2018-09-26 08:27:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:16,167 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-09-26 08:27:16,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:27:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-09-26 08:27:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:27:16,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:16,168 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1, 1, 1] [2018-09-26 08:27:16,168 INFO L423 AbstractCegarLoop]: === Iteration 188 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:16,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:16,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1444900999, now seen corresponding path program 185 times [2018-09-26 08:27:16,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:16,339 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:16,339 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:27:16,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:27:16,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:27:16,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:27:16,340 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 66 states. [2018-09-26 08:27:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:16,564 INFO L93 Difference]: Finished difference Result 198 states and 200 transitions. [2018-09-26 08:27:16,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:27:16,564 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-09-26 08:27:16,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:16,565 INFO L225 Difference]: With dead ends: 198 [2018-09-26 08:27:16,565 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:27:16,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:27:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:27:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:27:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:27:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-26 08:27:16,642 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 130 [2018-09-26 08:27:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:16,642 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-26 08:27:16,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:27:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-26 08:27:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:27:16,642 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:16,642 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1, 1, 1] [2018-09-26 08:27:16,643 INFO L423 AbstractCegarLoop]: === Iteration 189 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:16,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash 519259053, now seen corresponding path program 186 times [2018-09-26 08:27:16,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:16,812 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:16,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:27:16,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:27:16,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:27:16,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:27:16,813 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-09-26 08:27:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:16,923 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2018-09-26 08:27:16,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:27:16,923 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-09-26 08:27:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:16,924 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:27:16,924 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:27:16,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:27:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:27:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-09-26 08:27:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 08:27:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-09-26 08:27:17,004 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 130 [2018-09-26 08:27:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:17,004 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-09-26 08:27:17,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:27:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-09-26 08:27:17,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 08:27:17,004 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:17,004 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1] [2018-09-26 08:27:17,005 INFO L423 AbstractCegarLoop]: === Iteration 190 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:17,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:17,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1082900063, now seen corresponding path program 187 times [2018-09-26 08:27:17,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:17,371 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:27:17,372 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:17,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:27:17,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:27:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:27:17,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:27:17,373 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 66 states. [2018-09-26 08:27:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:18,058 INFO L93 Difference]: Finished difference Result 200 states and 202 transitions. [2018-09-26 08:27:18,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:27:18,059 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 131 [2018-09-26 08:27:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:18,059 INFO L225 Difference]: With dead ends: 200 [2018-09-26 08:27:18,059 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:27:18,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:27:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:27:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 134. [2018-09-26 08:27:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:27:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2018-09-26 08:27:18,148 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 131 [2018-09-26 08:27:18,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:18,148 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2018-09-26 08:27:18,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:27:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2018-09-26 08:27:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:27:18,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:18,149 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1, 1, 1] [2018-09-26 08:27:18,149 INFO L423 AbstractCegarLoop]: === Iteration 191 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:18,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash 789774893, now seen corresponding path program 188 times [2018-09-26 08:27:18,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:18,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:18,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:27:18,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:27:18,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:27:18,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:27:18,336 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 67 states. [2018-09-26 08:27:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:18,572 INFO L93 Difference]: Finished difference Result 201 states and 203 transitions. [2018-09-26 08:27:18,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:27:18,572 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-09-26 08:27:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:18,572 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:27:18,572 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:27:18,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:27:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:27:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:27:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:27:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-26 08:27:18,662 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 132 [2018-09-26 08:27:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:18,663 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-26 08:27:18,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:27:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-26 08:27:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:27:18,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:18,663 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1, 1, 1] [2018-09-26 08:27:18,663 INFO L423 AbstractCegarLoop]: === Iteration 192 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:18,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2135321657, now seen corresponding path program 189 times [2018-09-26 08:27:18,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:18,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:18,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:27:18,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:27:18,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:27:18,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:27:18,821 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2018-09-26 08:27:18,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:18,928 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-09-26 08:27:18,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:27:18,928 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-09-26 08:27:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:18,928 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:27:18,928 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:27:18,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:27:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:27:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-09-26 08:27:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:27:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-09-26 08:27:19,008 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 132 [2018-09-26 08:27:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:19,009 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-09-26 08:27:19,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:27:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-09-26 08:27:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-26 08:27:19,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:19,009 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1] [2018-09-26 08:27:19,010 INFO L423 AbstractCegarLoop]: === Iteration 193 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:19,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1770523449, now seen corresponding path program 190 times [2018-09-26 08:27:19,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:19,294 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:27:19,295 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:19,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:27:19,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:27:19,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:27:19,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:27:19,296 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 67 states. [2018-09-26 08:27:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:19,962 INFO L93 Difference]: Finished difference Result 203 states and 205 transitions. [2018-09-26 08:27:19,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:27:19,962 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 133 [2018-09-26 08:27:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:19,963 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:27:19,963 INFO L226 Difference]: Without dead ends: 200 [2018-09-26 08:27:19,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:27:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-26 08:27:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 136. [2018-09-26 08:27:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:27:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-09-26 08:27:20,058 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 133 [2018-09-26 08:27:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:20,058 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-09-26 08:27:20,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:27:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-09-26 08:27:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:27:20,059 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:20,059 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1, 1, 1] [2018-09-26 08:27:20,059 INFO L423 AbstractCegarLoop]: === Iteration 194 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:20,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:20,059 INFO L82 PathProgramCache]: Analyzing trace with hash 948286407, now seen corresponding path program 191 times [2018-09-26 08:27:20,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:20,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:20,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:27:20,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:27:20,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:27:20,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:27:20,246 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 68 states. [2018-09-26 08:27:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:20,483 INFO L93 Difference]: Finished difference Result 204 states and 206 transitions. [2018-09-26 08:27:20,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:27:20,483 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-09-26 08:27:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:20,484 INFO L225 Difference]: With dead ends: 204 [2018-09-26 08:27:20,484 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:27:20,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:27:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:27:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:27:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:27:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-26 08:27:20,577 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 134 [2018-09-26 08:27:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:20,577 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-26 08:27:20,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:27:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-26 08:27:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:27:20,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:20,578 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1, 1, 1] [2018-09-26 08:27:20,578 INFO L423 AbstractCegarLoop]: === Iteration 195 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:20,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:20,578 INFO L82 PathProgramCache]: Analyzing trace with hash 464606573, now seen corresponding path program 192 times [2018-09-26 08:27:20,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:20,786 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:20,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:27:20,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:27:20,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:27:20,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:27:20,787 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-09-26 08:27:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:20,919 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-09-26 08:27:20,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:27:20,919 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-09-26 08:27:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:20,920 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:27:20,920 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:27:20,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:27:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:27:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-09-26 08:27:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:27:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-09-26 08:27:21,017 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2018-09-26 08:27:21,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:21,017 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-09-26 08:27:21,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:27:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-09-26 08:27:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 08:27:21,018 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:21,018 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1] [2018-09-26 08:27:21,018 INFO L423 AbstractCegarLoop]: === Iteration 196 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:21,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:21,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1517840353, now seen corresponding path program 193 times [2018-09-26 08:27:21,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:21,360 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:27:21,361 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:21,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:27:21,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:27:21,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:27:21,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:27:21,361 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 68 states. [2018-09-26 08:27:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:22,040 INFO L93 Difference]: Finished difference Result 206 states and 208 transitions. [2018-09-26 08:27:22,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:27:22,040 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 135 [2018-09-26 08:27:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:22,041 INFO L225 Difference]: With dead ends: 206 [2018-09-26 08:27:22,041 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:27:22,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:27:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:27:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 138. [2018-09-26 08:27:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:27:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2018-09-26 08:27:22,139 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 135 [2018-09-26 08:27:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:22,139 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2018-09-26 08:27:22,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:27:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-09-26 08:27:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:27:22,140 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:22,140 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1, 1, 1] [2018-09-26 08:27:22,140 INFO L423 AbstractCegarLoop]: === Iteration 197 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:22,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:22,140 INFO L82 PathProgramCache]: Analyzing trace with hash -191650835, now seen corresponding path program 194 times [2018-09-26 08:27:22,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:22,338 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:22,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:27:22,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:27:22,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:27:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:27:22,339 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 69 states. [2018-09-26 08:27:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:22,600 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-09-26 08:27:22,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:27:22,600 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-09-26 08:27:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:22,600 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:27:22,600 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:27:22,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:27:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:27:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:27:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:27:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-09-26 08:27:22,685 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 136 [2018-09-26 08:27:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:22,685 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-09-26 08:27:22,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:27:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-09-26 08:27:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:27:22,685 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:22,685 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1, 1, 1] [2018-09-26 08:27:22,686 INFO L423 AbstractCegarLoop]: === Iteration 198 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:22,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:22,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1994143495, now seen corresponding path program 195 times [2018-09-26 08:27:22,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:22,882 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:22,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:27:22,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:27:22,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:27:22,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:27:22,884 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2018-09-26 08:27:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:23,031 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-09-26 08:27:23,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:27:23,031 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-09-26 08:27:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:23,031 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:27:23,031 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 08:27:23,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:27:23,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 08:27:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-09-26 08:27:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:27:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-09-26 08:27:23,126 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 136 [2018-09-26 08:27:23,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:23,126 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-09-26 08:27:23,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:27:23,126 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-09-26 08:27:23,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-26 08:27:23,126 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:23,126 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1] [2018-09-26 08:27:23,127 INFO L423 AbstractCegarLoop]: === Iteration 199 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:23,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1688844679, now seen corresponding path program 196 times [2018-09-26 08:27:23,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:23,441 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:27:23,441 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:23,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:27:23,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:27:23,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:27:23,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:27:23,442 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 69 states. [2018-09-26 08:27:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:24,165 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2018-09-26 08:27:24,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:27:24,165 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 137 [2018-09-26 08:27:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:24,165 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:27:24,165 INFO L226 Difference]: Without dead ends: 206 [2018-09-26 08:27:24,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:27:24,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-26 08:27:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 140. [2018-09-26 08:27:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-09-26 08:27:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-09-26 08:27:24,262 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 137 [2018-09-26 08:27:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:24,263 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-09-26 08:27:24,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:27:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-09-26 08:27:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:27:24,263 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:24,263 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1, 1, 1] [2018-09-26 08:27:24,263 INFO L423 AbstractCegarLoop]: === Iteration 200 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:24,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:24,264 INFO L82 PathProgramCache]: Analyzing trace with hash 814515975, now seen corresponding path program 197 times [2018-09-26 08:27:24,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:24,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:24,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:27:24,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:27:24,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:27:24,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:27:24,430 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 70 states. [2018-09-26 08:27:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:24,751 INFO L93 Difference]: Finished difference Result 210 states and 212 transitions. [2018-09-26 08:27:24,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:27:24,751 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-09-26 08:27:24,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:24,751 INFO L225 Difference]: With dead ends: 210 [2018-09-26 08:27:24,752 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:27:24,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:27:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:27:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:27:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:27:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-26 08:27:24,839 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 138 [2018-09-26 08:27:24,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:24,839 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-26 08:27:24,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:27:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-26 08:27:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:27:24,840 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:24,840 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1, 1, 1] [2018-09-26 08:27:24,841 INFO L423 AbstractCegarLoop]: === Iteration 201 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:24,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:24,841 INFO L82 PathProgramCache]: Analyzing trace with hash -145336531, now seen corresponding path program 198 times [2018-09-26 08:27:24,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:25,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:25,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:27:25,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:27:25,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:27:25,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:27:25,042 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-09-26 08:27:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:25,165 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2018-09-26 08:27:25,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:27:25,165 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-09-26 08:27:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:25,165 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:27:25,166 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:27:25,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 67 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:27:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:27:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-09-26 08:27:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-09-26 08:27:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-09-26 08:27:25,264 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 138 [2018-09-26 08:27:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:25,264 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-09-26 08:27:25,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:27:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-09-26 08:27:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 08:27:25,265 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:25,265 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1] [2018-09-26 08:27:25,265 INFO L423 AbstractCegarLoop]: === Iteration 202 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:25,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash -210526687, now seen corresponding path program 199 times [2018-09-26 08:27:25,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:25,645 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:27:25,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:25,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:27:25,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:27:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:27:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:27:25,646 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 70 states. [2018-09-26 08:27:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:26,361 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-09-26 08:27:26,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:27:26,361 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 139 [2018-09-26 08:27:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:26,362 INFO L225 Difference]: With dead ends: 212 [2018-09-26 08:27:26,362 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:27:26,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:27:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:27:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 142. [2018-09-26 08:27:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 08:27:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2018-09-26 08:27:26,466 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 139 [2018-09-26 08:27:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:26,467 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2018-09-26 08:27:26,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:27:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2018-09-26 08:27:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:27:26,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:26,467 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1, 1, 1] [2018-09-26 08:27:26,468 INFO L423 AbstractCegarLoop]: === Iteration 203 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:26,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:26,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2063545773, now seen corresponding path program 200 times [2018-09-26 08:27:26,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:26,672 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:26,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:27:26,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:27:26,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:27:26,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:27:26,674 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 71 states. [2018-09-26 08:27:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:26,988 INFO L93 Difference]: Finished difference Result 213 states and 215 transitions. [2018-09-26 08:27:26,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:27:26,988 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-09-26 08:27:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:26,988 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:27:26,988 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:27:26,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:27:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:27:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:27:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:27:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-26 08:27:27,087 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 140 [2018-09-26 08:27:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:27,087 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-26 08:27:27,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:27:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-26 08:27:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:27:27,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:27,088 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1, 1, 1] [2018-09-26 08:27:27,088 INFO L423 AbstractCegarLoop]: === Iteration 204 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:27,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:27,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1922078137, now seen corresponding path program 201 times [2018-09-26 08:27:27,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:27,301 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:27,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:27:27,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:27:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:27:27,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:27:27,302 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2018-09-26 08:27:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:27,436 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-09-26 08:27:27,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:27:27,437 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-09-26 08:27:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:27,437 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:27:27,437 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:27:27,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 68 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:27:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:27:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-09-26 08:27:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 08:27:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-09-26 08:27:27,537 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2018-09-26 08:27:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:27,537 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-09-26 08:27:27,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:27:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-09-26 08:27:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-26 08:27:27,537 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:27,538 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1] [2018-09-26 08:27:27,538 INFO L423 AbstractCegarLoop]: === Iteration 205 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:27,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:27,538 INFO L82 PathProgramCache]: Analyzing trace with hash 545058375, now seen corresponding path program 202 times [2018-09-26 08:27:27,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:27,863 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:27:27,863 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:27,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:27:27,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:27:27,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:27:27,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:27:27,864 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 71 states. [2018-09-26 08:27:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:28,627 INFO L93 Difference]: Finished difference Result 215 states and 217 transitions. [2018-09-26 08:27:28,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:27:28,628 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 141 [2018-09-26 08:27:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:28,628 INFO L225 Difference]: With dead ends: 215 [2018-09-26 08:27:28,628 INFO L226 Difference]: Without dead ends: 212 [2018-09-26 08:27:28,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:27:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-26 08:27:28,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 144. [2018-09-26 08:27:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:27:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-09-26 08:27:28,754 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 141 [2018-09-26 08:27:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:28,754 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-09-26 08:27:28,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:27:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-09-26 08:27:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:27:28,755 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:28,755 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1, 1, 1] [2018-09-26 08:27:28,755 INFO L423 AbstractCegarLoop]: === Iteration 206 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:28,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash -283121081, now seen corresponding path program 203 times [2018-09-26 08:27:28,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:28,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:28,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:27:28,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:27:28,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:27:28,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:27:28,942 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 72 states. [2018-09-26 08:27:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:29,239 INFO L93 Difference]: Finished difference Result 216 states and 218 transitions. [2018-09-26 08:27:29,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:27:29,240 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-09-26 08:27:29,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:29,240 INFO L225 Difference]: With dead ends: 216 [2018-09-26 08:27:29,240 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:27:29,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:27:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:27:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:27:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:27:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-26 08:27:29,353 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 142 [2018-09-26 08:27:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:29,354 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-26 08:27:29,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:27:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-26 08:27:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:27:29,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:29,354 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1, 1, 1] [2018-09-26 08:27:29,354 INFO L423 AbstractCegarLoop]: === Iteration 207 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:29,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:29,355 INFO L82 PathProgramCache]: Analyzing trace with hash 716589293, now seen corresponding path program 204 times [2018-09-26 08:27:29,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:29,586 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:29,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:27:29,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:27:29,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:27:29,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:27:29,587 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-09-26 08:27:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:29,752 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-09-26 08:27:29,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:27:29,752 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-09-26 08:27:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:29,753 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:27:29,753 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:27:29,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 69 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:27:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:27:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-09-26 08:27:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:27:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-09-26 08:27:29,851 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 142 [2018-09-26 08:27:29,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:29,852 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-09-26 08:27:29,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:27:29,852 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-09-26 08:27:29,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-26 08:27:29,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:29,852 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1] [2018-09-26 08:27:29,853 INFO L423 AbstractCegarLoop]: === Iteration 208 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:29,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:29,853 INFO L82 PathProgramCache]: Analyzing trace with hash 739370081, now seen corresponding path program 205 times [2018-09-26 08:27:29,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:30,212 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:27:30,212 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:30,212 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:27:30,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:27:30,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:27:30,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:27:30,213 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 72 states. [2018-09-26 08:27:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:30,986 INFO L93 Difference]: Finished difference Result 218 states and 220 transitions. [2018-09-26 08:27:30,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:27:30,986 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 143 [2018-09-26 08:27:30,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:30,987 INFO L225 Difference]: With dead ends: 218 [2018-09-26 08:27:30,987 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:27:30,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:27:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:27:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 146. [2018-09-26 08:27:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:27:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2018-09-26 08:27:31,094 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 143 [2018-09-26 08:27:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:31,094 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2018-09-26 08:27:31,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:27:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2018-09-26 08:27:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:27:31,095 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:31,095 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1, 1, 1] [2018-09-26 08:27:31,095 INFO L423 AbstractCegarLoop]: === Iteration 209 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:31,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:31,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1445574509, now seen corresponding path program 206 times [2018-09-26 08:27:31,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:31,315 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:31,315 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:27:31,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:27:31,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:27:31,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:27:31,317 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 73 states. [2018-09-26 08:27:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:31,614 INFO L93 Difference]: Finished difference Result 219 states and 221 transitions. [2018-09-26 08:27:31,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:27:31,615 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-09-26 08:27:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:31,615 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:27:31,615 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:27:31,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:27:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:27:31,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:27:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:27:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-09-26 08:27:31,714 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 144 [2018-09-26 08:27:31,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:31,714 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-09-26 08:27:31,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:27:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-09-26 08:27:31,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:27:31,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:31,715 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1, 1, 1] [2018-09-26 08:27:31,715 INFO L423 AbstractCegarLoop]: === Iteration 210 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:31,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1923142265, now seen corresponding path program 207 times [2018-09-26 08:27:31,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:31,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:31,931 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:31,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:27:31,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:27:31,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:27:31,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:27:31,932 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2018-09-26 08:27:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:32,084 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-09-26 08:27:32,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:27:32,084 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-09-26 08:27:32,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:32,085 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:27:32,085 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:27:32,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 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:27:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:27:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-09-26 08:27:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:27:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2018-09-26 08:27:32,190 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 144 [2018-09-26 08:27:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:32,191 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2018-09-26 08:27:32,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:27:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2018-09-26 08:27:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:27:32,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:32,191 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1] [2018-09-26 08:27:32,192 INFO L423 AbstractCegarLoop]: === Iteration 211 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:32,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:32,192 INFO L82 PathProgramCache]: Analyzing trace with hash 512070407, now seen corresponding path program 208 times [2018-09-26 08:27:32,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:32,559 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:27:32,559 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:32,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:27:32,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:27:32,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:27:32,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:27:32,560 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 73 states. [2018-09-26 08:27:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:33,385 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2018-09-26 08:27:33,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:27:33,385 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 145 [2018-09-26 08:27:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:33,385 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:27:33,385 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 08:27:33,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:27:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 08:27:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 148. [2018-09-26 08:27:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:27:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-09-26 08:27:33,498 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 145 [2018-09-26 08:27:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:33,498 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-09-26 08:27:33,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:27:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-09-26 08:27:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:27:33,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:33,499 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1, 1, 1] [2018-09-26 08:27:33,499 INFO L423 AbstractCegarLoop]: === Iteration 212 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:33,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:33,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1305748089, now seen corresponding path program 209 times [2018-09-26 08:27:33,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:33,737 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:33,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:27:33,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:27:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:27:33,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:27:33,739 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 74 states. [2018-09-26 08:27:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:34,011 INFO L93 Difference]: Finished difference Result 222 states and 224 transitions. [2018-09-26 08:27:34,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:27:34,011 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-09-26 08:27:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:34,012 INFO L225 Difference]: With dead ends: 222 [2018-09-26 08:27:34,012 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:27:34,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:27:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:27:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:27:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:27:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-09-26 08:27:34,118 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 146 [2018-09-26 08:27:34,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:34,118 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-09-26 08:27:34,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:27:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-09-26 08:27:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:27:34,119 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:34,119 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1, 1, 1] [2018-09-26 08:27:34,119 INFO L423 AbstractCegarLoop]: === Iteration 213 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:34,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:34,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1638214317, now seen corresponding path program 210 times [2018-09-26 08:27:34,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:34,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:34,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:27:34,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:27:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:27:34,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:27:34,350 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-09-26 08:27:34,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:34,490 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2018-09-26 08:27:34,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:27:34,490 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-09-26 08:27:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:34,490 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:27:34,491 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:27:34,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:27:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:27:34,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-09-26 08:27:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:27:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-09-26 08:27:34,597 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2018-09-26 08:27:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:34,597 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-09-26 08:27:34,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:27:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-09-26 08:27:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-26 08:27:34,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:34,598 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1] [2018-09-26 08:27:34,598 INFO L423 AbstractCegarLoop]: === Iteration 214 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:34,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:34,598 INFO L82 PathProgramCache]: Analyzing trace with hash -755025247, now seen corresponding path program 211 times [2018-09-26 08:27:34,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:34,930 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:27:34,931 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:34,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:27:34,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:27:34,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:27:34,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:27:34,932 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 74 states. [2018-09-26 08:27:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:35,690 INFO L93 Difference]: Finished difference Result 224 states and 226 transitions. [2018-09-26 08:27:35,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:27:35,690 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 147 [2018-09-26 08:27:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:35,690 INFO L225 Difference]: With dead ends: 224 [2018-09-26 08:27:35,690 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 08:27:35,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:27:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 08:27:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 150. [2018-09-26 08:27:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:27:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-09-26 08:27:35,803 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 147 [2018-09-26 08:27:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:35,803 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-09-26 08:27:35,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:27:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-09-26 08:27:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:27:35,804 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:35,804 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1, 1, 1] [2018-09-26 08:27:35,804 INFO L423 AbstractCegarLoop]: === Iteration 215 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:35,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:35,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1931007699, now seen corresponding path program 212 times [2018-09-26 08:27:35,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:36,016 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:36,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:27:36,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:27:36,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:27:36,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:27:36,017 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 75 states. [2018-09-26 08:27:36,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:36,294 INFO L93 Difference]: Finished difference Result 225 states and 227 transitions. [2018-09-26 08:27:36,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:27:36,294 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-09-26 08:27:36,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:36,295 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:27:36,295 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:27:36,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:27:36,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:27:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:27:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:27:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-09-26 08:27:36,425 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 148 [2018-09-26 08:27:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:36,425 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-09-26 08:27:36,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:27:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-09-26 08:27:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:27:36,425 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:36,425 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1, 1, 1] [2018-09-26 08:27:36,426 INFO L423 AbstractCegarLoop]: === Iteration 216 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:36,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:36,426 INFO L82 PathProgramCache]: Analyzing trace with hash -862486329, now seen corresponding path program 213 times [2018-09-26 08:27:36,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:36,654 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:36,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:27:36,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:27:36,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:27:36,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:27:36,655 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2018-09-26 08:27:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:36,797 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-09-26 08:27:36,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:27:36,797 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-09-26 08:27:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:36,797 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:27:36,797 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:27:36,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:27:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:27:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-09-26 08:27:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:27:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-09-26 08:27:36,907 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 148 [2018-09-26 08:27:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:36,907 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-09-26 08:27:36,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:27:36,908 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-09-26 08:27:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-26 08:27:36,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:36,908 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1] [2018-09-26 08:27:36,908 INFO L423 AbstractCegarLoop]: === Iteration 217 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:36,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:36,908 INFO L82 PathProgramCache]: Analyzing trace with hash -967333945, now seen corresponding path program 214 times [2018-09-26 08:27:36,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:37,252 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:27:37,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:37,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:27:37,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:27:37,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:27:37,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:27:37,253 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 75 states. [2018-09-26 08:27:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:38,038 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-09-26 08:27:38,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:27:38,038 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 149 [2018-09-26 08:27:38,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:38,039 INFO L225 Difference]: With dead ends: 227 [2018-09-26 08:27:38,039 INFO L226 Difference]: Without dead ends: 224 [2018-09-26 08:27:38,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:27:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-26 08:27:38,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2018-09-26 08:27:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:27:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-09-26 08:27:38,184 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 149 [2018-09-26 08:27:38,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:38,184 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-09-26 08:27:38,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:27:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-09-26 08:27:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:27:38,185 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:38,185 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1, 1, 1] [2018-09-26 08:27:38,185 INFO L423 AbstractCegarLoop]: === Iteration 218 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:38,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash 77357255, now seen corresponding path program 215 times [2018-09-26 08:27:38,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:38,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:38,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:27:38,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:27:38,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:27:38,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:27:38,399 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 76 states. [2018-09-26 08:27:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:38,733 INFO L93 Difference]: Finished difference Result 228 states and 230 transitions. [2018-09-26 08:27:38,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:27:38,733 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-09-26 08:27:38,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:38,733 INFO L225 Difference]: With dead ends: 228 [2018-09-26 08:27:38,733 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:27:38,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:27:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:27:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:27:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:27:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-09-26 08:27:38,846 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 150 [2018-09-26 08:27:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:38,847 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-09-26 08:27:38,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:27:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-09-26 08:27:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:27:38,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:38,847 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1, 1, 1] [2018-09-26 08:27:38,847 INFO L423 AbstractCegarLoop]: === Iteration 219 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:38,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:38,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1158218643, now seen corresponding path program 216 times [2018-09-26 08:27:38,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:39,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:39,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:27:39,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:27:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:27:39,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:27:39,149 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-09-26 08:27:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:39,400 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2018-09-26 08:27:39,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:27:39,400 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-09-26 08:27:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:39,401 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:27:39,401 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:27:39,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:27:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:27:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-09-26 08:27:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:27:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2018-09-26 08:27:39,567 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 150 [2018-09-26 08:27:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:39,568 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2018-09-26 08:27:39,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:27:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2018-09-26 08:27:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-26 08:27:39,569 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:39,569 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1] [2018-09-26 08:27:39,569 INFO L423 AbstractCegarLoop]: === Iteration 220 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:39,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:39,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1545101087, now seen corresponding path program 217 times [2018-09-26 08:27:39,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:39,923 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:27:39,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:39,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:27:39,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:27:39,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:27:39,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:27:39,924 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 76 states. [2018-09-26 08:27:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:40,723 INFO L93 Difference]: Finished difference Result 230 states and 232 transitions. [2018-09-26 08:27:40,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:27:40,723 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 151 [2018-09-26 08:27:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:40,724 INFO L225 Difference]: With dead ends: 230 [2018-09-26 08:27:40,724 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:27:40,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:27:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:27:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 154. [2018-09-26 08:27:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-09-26 08:27:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2018-09-26 08:27:40,834 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 151 [2018-09-26 08:27:40,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:40,835 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2018-09-26 08:27:40,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:27:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2018-09-26 08:27:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:27:40,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:40,835 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1, 1, 1] [2018-09-26 08:27:40,835 INFO L423 AbstractCegarLoop]: === Iteration 221 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:40,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:40,835 INFO L82 PathProgramCache]: Analyzing trace with hash -653554963, now seen corresponding path program 218 times [2018-09-26 08:27:40,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:41,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:41,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:27:41,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:27:41,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:27:41,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:27:41,021 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 77 states. [2018-09-26 08:27:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:41,317 INFO L93 Difference]: Finished difference Result 231 states and 233 transitions. [2018-09-26 08:27:41,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:27:41,317 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-09-26 08:27:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:41,318 INFO L225 Difference]: With dead ends: 231 [2018-09-26 08:27:41,318 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:27:41,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:27:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:27:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:27:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:27:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-09-26 08:27:41,420 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 152 [2018-09-26 08:27:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:41,420 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-09-26 08:27:41,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:27:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-09-26 08:27:41,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:27:41,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:41,421 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1, 1, 1] [2018-09-26 08:27:41,421 INFO L423 AbstractCegarLoop]: === Iteration 222 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:41,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:41,421 INFO L82 PathProgramCache]: Analyzing trace with hash -301702137, now seen corresponding path program 219 times [2018-09-26 08:27:41,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:41,622 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:41,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:27:41,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:27:41,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:27:41,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:27:41,623 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2018-09-26 08:27:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:41,757 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-09-26 08:27:41,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:27:41,757 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-09-26 08:27:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:41,758 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:27:41,758 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:27:41,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:27:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:27:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-09-26 08:27:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-09-26 08:27:41,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-09-26 08:27:41,863 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2018-09-26 08:27:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:41,863 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-09-26 08:27:41,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:27:41,864 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-09-26 08:27:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-26 08:27:41,864 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:41,864 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1] [2018-09-26 08:27:41,864 INFO L423 AbstractCegarLoop]: === Iteration 223 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:41,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:41,865 INFO L82 PathProgramCache]: Analyzing trace with hash -762893177, now seen corresponding path program 220 times [2018-09-26 08:27:41,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:42,210 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:27:42,210 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:42,210 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:27:42,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:27:42,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:27:42,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:27:42,211 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 77 states. [2018-09-26 08:27:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:43,018 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2018-09-26 08:27:43,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:27:43,018 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 153 [2018-09-26 08:27:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:43,019 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:27:43,019 INFO L226 Difference]: Without dead ends: 230 [2018-09-26 08:27:43,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:27:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-26 08:27:43,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 156. [2018-09-26 08:27:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 08:27:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-09-26 08:27:43,141 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 153 [2018-09-26 08:27:43,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:43,141 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-09-26 08:27:43,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:27:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-09-26 08:27:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:27:43,142 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:43,142 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1, 1, 1] [2018-09-26 08:27:43,142 INFO L423 AbstractCegarLoop]: === Iteration 224 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:43,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:43,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2120053767, now seen corresponding path program 221 times [2018-09-26 08:27:43,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:43,373 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:43,373 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:27:43,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:27:43,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:27:43,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:27:43,374 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 78 states. [2018-09-26 08:27:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:43,727 INFO L93 Difference]: Finished difference Result 234 states and 236 transitions. [2018-09-26 08:27:43,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:27:43,727 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-09-26 08:27:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:43,728 INFO L225 Difference]: With dead ends: 234 [2018-09-26 08:27:43,728 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:27:43,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:27:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:27:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:27:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:27:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-09-26 08:27:43,876 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 154 [2018-09-26 08:27:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:43,876 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-09-26 08:27:43,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:27:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-09-26 08:27:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:27:43,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:43,877 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1, 1, 1] [2018-09-26 08:27:43,877 INFO L423 AbstractCegarLoop]: === Iteration 225 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:43,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash 142589485, now seen corresponding path program 222 times [2018-09-26 08:27:43,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:44,119 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:44,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:27:44,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:27:44,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:27:44,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:27:44,119 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-09-26 08:27:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:44,270 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-09-26 08:27:44,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:27:44,270 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-09-26 08:27:44,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:44,271 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:27:44,271 INFO L226 Difference]: Without dead ends: 156 [2018-09-26 08:27:44,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:27:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-09-26 08:27:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-09-26 08:27:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 08:27:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-09-26 08:27:44,387 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 154 [2018-09-26 08:27:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:44,388 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-09-26 08:27:44,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:27:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-09-26 08:27:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-26 08:27:44,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:44,388 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1] [2018-09-26 08:27:44,388 INFO L423 AbstractCegarLoop]: === Iteration 226 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:44,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash 125245217, now seen corresponding path program 223 times [2018-09-26 08:27:44,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:44,749 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:27:44,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:44,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:27:44,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:27:44,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:27:44,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:27:44,750 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 78 states. [2018-09-26 08:27:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:45,597 INFO L93 Difference]: Finished difference Result 236 states and 238 transitions. [2018-09-26 08:27:45,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:27:45,597 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 155 [2018-09-26 08:27:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:45,598 INFO L225 Difference]: With dead ends: 236 [2018-09-26 08:27:45,598 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:27:45,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:27:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:27:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 158. [2018-09-26 08:27:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 08:27:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 160 transitions. [2018-09-26 08:27:45,718 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 160 transitions. Word has length 155 [2018-09-26 08:27:45,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:45,718 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 160 transitions. [2018-09-26 08:27:45,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:27:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2018-09-26 08:27:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:27:45,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:45,719 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1, 1, 1] [2018-09-26 08:27:45,719 INFO L423 AbstractCegarLoop]: === Iteration 227 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:45,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:45,719 INFO L82 PathProgramCache]: Analyzing trace with hash -412427091, now seen corresponding path program 224 times [2018-09-26 08:27:45,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:45,959 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:45,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:27:45,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:27:45,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:27:45,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:27:45,960 INFO L87 Difference]: Start difference. First operand 158 states and 160 transitions. Second operand 79 states. [2018-09-26 08:27:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:46,295 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-09-26 08:27:46,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:27:46,295 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-09-26 08:27:46,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:46,296 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:27:46,296 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:27:46,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:27:46,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:27:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:27:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:27:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-09-26 08:27:46,407 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 156 [2018-09-26 08:27:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:46,408 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-09-26 08:27:46,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:27:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-09-26 08:27:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:27:46,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:46,408 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1, 1, 1] [2018-09-26 08:27:46,408 INFO L423 AbstractCegarLoop]: === Iteration 228 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:46,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1584277689, now seen corresponding path program 225 times [2018-09-26 08:27:46,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:46,615 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:46,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:27:46,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:27:46,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:27:46,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:27:46,616 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2018-09-26 08:27:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:46,754 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2018-09-26 08:27:46,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:27:46,754 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-09-26 08:27:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:46,755 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:27:46,755 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:27:46,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:27:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:27:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-09-26 08:27:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 08:27:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2018-09-26 08:27:46,865 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 156 [2018-09-26 08:27:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:46,865 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2018-09-26 08:27:46,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:27:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2018-09-26 08:27:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-26 08:27:46,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:46,866 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1] [2018-09-26 08:27:46,866 INFO L423 AbstractCegarLoop]: === Iteration 229 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:46,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:46,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1868029625, now seen corresponding path program 226 times [2018-09-26 08:27:46,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:47,203 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:27:47,203 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:47,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:27:47,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:27:47,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:27:47,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:27:47,204 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 79 states. [2018-09-26 08:27:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:48,054 INFO L93 Difference]: Finished difference Result 239 states and 241 transitions. [2018-09-26 08:27:48,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:27:48,055 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 157 [2018-09-26 08:27:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:48,055 INFO L225 Difference]: With dead ends: 239 [2018-09-26 08:27:48,055 INFO L226 Difference]: Without dead ends: 236 [2018-09-26 08:27:48,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:27:48,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-09-26 08:27:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 160. [2018-09-26 08:27:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-26 08:27:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-09-26 08:27:48,172 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 157 [2018-09-26 08:27:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:48,172 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-09-26 08:27:48,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:27:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-09-26 08:27:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:27:48,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:48,173 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1, 1, 1] [2018-09-26 08:27:48,173 INFO L423 AbstractCegarLoop]: === Iteration 230 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:48,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:48,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2074405049, now seen corresponding path program 227 times [2018-09-26 08:27:48,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:48,384 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:48,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:27:48,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:27:48,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:27:48,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:27:48,385 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 80 states. [2018-09-26 08:27:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:48,714 INFO L93 Difference]: Finished difference Result 240 states and 242 transitions. [2018-09-26 08:27:48,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:27:48,714 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-09-26 08:27:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:48,715 INFO L225 Difference]: With dead ends: 240 [2018-09-26 08:27:48,715 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:27:48,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:27:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:27:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:27:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:27:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-09-26 08:27:48,826 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 158 [2018-09-26 08:27:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:48,826 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-09-26 08:27:48,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:27:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-09-26 08:27:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:27:48,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:48,827 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1, 1, 1] [2018-09-26 08:27:48,827 INFO L423 AbstractCegarLoop]: === Iteration 231 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:48,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:48,827 INFO L82 PathProgramCache]: Analyzing trace with hash 252932077, now seen corresponding path program 228 times [2018-09-26 08:27:48,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:49,048 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:49,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:27:49,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:27:49,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:27:49,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:27:49,049 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-09-26 08:27:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:49,191 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2018-09-26 08:27:49,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:27:49,191 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-09-26 08:27:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:49,191 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:27:49,191 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 08:27:49,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:27:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 08:27:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-09-26 08:27:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-26 08:27:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-09-26 08:27:49,303 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2018-09-26 08:27:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:49,303 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-09-26 08:27:49,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:27:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-09-26 08:27:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-26 08:27:49,304 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:49,304 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1] [2018-09-26 08:27:49,304 INFO L423 AbstractCegarLoop]: === Iteration 232 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:49,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash -749101727, now seen corresponding path program 229 times [2018-09-26 08:27:49,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:49,741 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:27:49,741 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:49,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:27:49,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:27:49,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:27:49,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:27:49,742 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 80 states. [2018-09-26 08:27:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:50,610 INFO L93 Difference]: Finished difference Result 242 states and 244 transitions. [2018-09-26 08:27:50,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:27:50,610 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 159 [2018-09-26 08:27:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:50,611 INFO L225 Difference]: With dead ends: 242 [2018-09-26 08:27:50,611 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:27:50,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:27:50,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:27:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 162. [2018-09-26 08:27:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 08:27:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2018-09-26 08:27:50,743 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 159 [2018-09-26 08:27:50,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:50,743 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2018-09-26 08:27:50,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:27:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-09-26 08:27:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:27:50,743 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:50,744 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1, 1, 1] [2018-09-26 08:27:50,744 INFO L423 AbstractCegarLoop]: === Iteration 233 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:50,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:50,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1747378579, now seen corresponding path program 230 times [2018-09-26 08:27:50,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:50,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:50,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:27:50,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:27:50,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:27:50,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:27:50,993 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand 81 states. [2018-09-26 08:27:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:51,356 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2018-09-26 08:27:51,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:27:51,356 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-09-26 08:27:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:51,357 INFO L225 Difference]: With dead ends: 243 [2018-09-26 08:27:51,357 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:27:51,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:27:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:27:51,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:27:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:27:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-09-26 08:27:51,486 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 160 [2018-09-26 08:27:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:51,486 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-09-26 08:27:51,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:27:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-09-26 08:27:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:27:51,486 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:51,487 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1, 1, 1] [2018-09-26 08:27:51,487 INFO L423 AbstractCegarLoop]: === Iteration 234 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:51,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:51,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1680595591, now seen corresponding path program 231 times [2018-09-26 08:27:51,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:51,745 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:51,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:27:51,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:27:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:27:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:27:51,746 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2018-09-26 08:27:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:51,912 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-09-26 08:27:51,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:27:51,912 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-09-26 08:27:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:51,912 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:27:51,912 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 08:27:51,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:27:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 08:27:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-26 08:27:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 08:27:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-09-26 08:27:52,047 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 160 [2018-09-26 08:27:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:52,048 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-09-26 08:27:52,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:27:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-09-26 08:27:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-26 08:27:52,048 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:52,048 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1] [2018-09-26 08:27:52,048 INFO L423 AbstractCegarLoop]: === Iteration 235 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:52,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:52,049 INFO L82 PathProgramCache]: Analyzing trace with hash 558794247, now seen corresponding path program 232 times [2018-09-26 08:27:52,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:52,439 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:27:52,439 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:52,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:27:52,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:27:52,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:27:52,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:27:52,440 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 81 states. [2018-09-26 08:27:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:53,350 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2018-09-26 08:27:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:27:53,350 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 161 [2018-09-26 08:27:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:53,351 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:27:53,351 INFO L226 Difference]: Without dead ends: 242 [2018-09-26 08:27:53,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:27:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-26 08:27:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 164. [2018-09-26 08:27:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-26 08:27:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-09-26 08:27:53,512 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 161 [2018-09-26 08:27:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:53,512 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-09-26 08:27:53,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:27:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-09-26 08:27:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:27:53,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:53,513 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1, 1, 1] [2018-09-26 08:27:53,513 INFO L423 AbstractCegarLoop]: === Iteration 236 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:53,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:53,513 INFO L82 PathProgramCache]: Analyzing trace with hash 142690951, now seen corresponding path program 233 times [2018-09-26 08:27:53,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3160 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:53,773 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:53,773 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:27:53,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:27:53,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:27:53,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:27:53,774 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 82 states. [2018-09-26 08:27:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:54,100 INFO L93 Difference]: Finished difference Result 246 states and 248 transitions. [2018-09-26 08:27:54,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:27:54,100 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-09-26 08:27:54,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:54,101 INFO L225 Difference]: With dead ends: 246 [2018-09-26 08:27:54,101 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:27:54,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:27:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:27:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:27:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:27:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-09-26 08:27:54,229 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 162 [2018-09-26 08:27:54,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:54,229 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-09-26 08:27:54,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:27:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-09-26 08:27:54,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:27:54,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:54,230 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1, 1, 1] [2018-09-26 08:27:54,230 INFO L423 AbstractCegarLoop]: === Iteration 237 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:54,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:54,230 INFO L82 PathProgramCache]: Analyzing trace with hash -964292179, now seen corresponding path program 234 times [2018-09-26 08:27:54,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3160 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:54,456 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:54,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:27:54,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:27:54,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:27:54,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:27:54,457 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2018-09-26 08:27:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:54,618 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2018-09-26 08:27:54,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:27:54,618 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-09-26 08:27:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:54,618 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:27:54,619 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:27:54,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 79 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:27:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:27:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-09-26 08:27:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-26 08:27:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2018-09-26 08:27:54,742 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 162 [2018-09-26 08:27:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:54,742 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2018-09-26 08:27:54,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:27:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2018-09-26 08:27:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-26 08:27:54,743 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:54,743 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1] [2018-09-26 08:27:54,743 INFO L423 AbstractCegarLoop]: === Iteration 238 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:54,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:54,743 INFO L82 PathProgramCache]: Analyzing trace with hash 171652001, now seen corresponding path program 235 times [2018-09-26 08:27:54,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:55,150 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:27:55,151 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:55,151 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:27:55,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:27:55,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:27:55,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:27:55,151 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 82 states. [2018-09-26 08:27:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:56,080 INFO L93 Difference]: Finished difference Result 248 states and 250 transitions. [2018-09-26 08:27:56,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:27:56,080 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 163 [2018-09-26 08:27:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:56,081 INFO L225 Difference]: With dead ends: 248 [2018-09-26 08:27:56,081 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 08:27:56,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:27:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 08:27:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 166. [2018-09-26 08:27:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:27:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2018-09-26 08:27:56,219 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 163 [2018-09-26 08:27:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:56,220 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2018-09-26 08:27:56,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:27:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2018-09-26 08:27:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:27:56,220 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:56,220 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1, 1, 1] [2018-09-26 08:27:56,220 INFO L423 AbstractCegarLoop]: === Iteration 239 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:56,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:56,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1026183213, now seen corresponding path program 236 times [2018-09-26 08:27:56,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3240 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:56,489 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:56,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:27:56,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:27:56,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:27:56,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:27:56,490 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 83 states. [2018-09-26 08:27:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:56,848 INFO L93 Difference]: Finished difference Result 249 states and 251 transitions. [2018-09-26 08:27:56,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:27:56,848 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-09-26 08:27:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:56,849 INFO L225 Difference]: With dead ends: 249 [2018-09-26 08:27:56,849 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:27:56,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:27:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:27:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:27:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:27:56,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-09-26 08:27:56,984 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 164 [2018-09-26 08:27:56,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:56,984 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-09-26 08:27:56,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:27:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-09-26 08:27:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:27:56,985 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:56,985 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1, 1, 1] [2018-09-26 08:27:56,985 INFO L423 AbstractCegarLoop]: === Iteration 240 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:56,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:56,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1069444551, now seen corresponding path program 237 times [2018-09-26 08:27:56,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3240 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:57,282 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:57,282 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:27:57,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:27:57,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:27:57,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:27:57,283 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2018-09-26 08:27:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:57,466 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2018-09-26 08:27:57,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:27:57,466 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-09-26 08:27:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:57,467 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:27:57,467 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 08:27:57,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:27:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 08:27:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-26 08:27:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:27:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-09-26 08:27:57,600 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 164 [2018-09-26 08:27:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:57,600 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-09-26 08:27:57,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:27:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-09-26 08:27:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-26 08:27:57,601 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:57,601 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1] [2018-09-26 08:27:57,601 INFO L423 AbstractCegarLoop]: === Iteration 241 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:57,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:57,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1207018809, now seen corresponding path program 238 times [2018-09-26 08:27:57,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:57,984 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:27:57,984 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:57,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:27:57,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:27:57,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:27:57,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:27:57,985 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 83 states. [2018-09-26 08:27:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:58,936 INFO L93 Difference]: Finished difference Result 251 states and 253 transitions. [2018-09-26 08:27:58,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:27:58,936 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 165 [2018-09-26 08:27:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:58,937 INFO L225 Difference]: With dead ends: 251 [2018-09-26 08:27:58,937 INFO L226 Difference]: Without dead ends: 248 [2018-09-26 08:27:58,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:27:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-09-26 08:27:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 168. [2018-09-26 08:27:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 08:27:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-09-26 08:27:59,137 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 165 [2018-09-26 08:27:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:59,137 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-09-26 08:27:59,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:27:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-09-26 08:27:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:27:59,138 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:59,138 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1, 1, 1] [2018-09-26 08:27:59,138 INFO L423 AbstractCegarLoop]: === Iteration 242 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:59,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:59,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1237061063, now seen corresponding path program 239 times [2018-09-26 08:27:59,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3321 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:59,402 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:59,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:27:59,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:27:59,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:27:59,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:27:59,403 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 84 states. [2018-09-26 08:27:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:59,730 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2018-09-26 08:27:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:27:59,730 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-09-26 08:27:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:59,730 INFO L225 Difference]: With dead ends: 252 [2018-09-26 08:27:59,730 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:27:59,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:27:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:27:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:27:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:27:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-09-26 08:27:59,853 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 166 [2018-09-26 08:27:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:59,853 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-09-26 08:27:59,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:27:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-09-26 08:27:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:27:59,854 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:59,854 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1, 1, 1] [2018-09-26 08:27:59,854 INFO L423 AbstractCegarLoop]: === Iteration 243 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:59,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:59,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1716804755, now seen corresponding path program 240 times [2018-09-26 08:27:59,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3321 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:00,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:00,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:28:00,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:28:00,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:28:00,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:28:00,110 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2018-09-26 08:28:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:00,288 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-09-26 08:28:00,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:28:00,288 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-09-26 08:28:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:00,289 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:28:00,289 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 08:28:00,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 81 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:28:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 08:28:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-09-26 08:28:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 08:28:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-09-26 08:28:00,428 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 166 [2018-09-26 08:28:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:00,428 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-09-26 08:28:00,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:28:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-09-26 08:28:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-26 08:28:00,428 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:00,429 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1] [2018-09-26 08:28:00,429 INFO L423 AbstractCegarLoop]: === Iteration 244 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:00,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:00,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1681401375, now seen corresponding path program 241 times [2018-09-26 08:28:00,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:00,888 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:28:00,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:00,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:28:00,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:28:00,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:28:00,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:28:00,890 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 84 states. [2018-09-26 08:28:01,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:01,852 INFO L93 Difference]: Finished difference Result 254 states and 256 transitions. [2018-09-26 08:28:01,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:28:01,852 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 167 [2018-09-26 08:28:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:01,853 INFO L225 Difference]: With dead ends: 254 [2018-09-26 08:28:01,853 INFO L226 Difference]: Without dead ends: 251 [2018-09-26 08:28:01,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:28:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-09-26 08:28:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 170. [2018-09-26 08:28:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-09-26 08:28:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2018-09-26 08:28:01,997 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 167 [2018-09-26 08:28:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:01,997 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2018-09-26 08:28:01,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:28:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2018-09-26 08:28:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:28:01,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:01,998 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1, 1, 1] [2018-09-26 08:28:01,998 INFO L423 AbstractCegarLoop]: === Iteration 245 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:01,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:01,998 INFO L82 PathProgramCache]: Analyzing trace with hash -583896595, now seen corresponding path program 242 times [2018-09-26 08:28:01,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3403 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:02,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:02,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:28:02,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:28:02,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:28:02,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:28:02,279 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 85 states. [2018-09-26 08:28:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:02,716 INFO L93 Difference]: Finished difference Result 255 states and 257 transitions. [2018-09-26 08:28:02,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:28:02,717 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-09-26 08:28:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:02,717 INFO L225 Difference]: With dead ends: 255 [2018-09-26 08:28:02,717 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:28:02,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:28:02,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:28:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:28:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:28:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-09-26 08:28:02,857 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 168 [2018-09-26 08:28:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:02,857 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-09-26 08:28:02,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:28:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-09-26 08:28:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:28:02,858 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:02,858 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1, 1, 1] [2018-09-26 08:28:02,858 INFO L423 AbstractCegarLoop]: === Iteration 246 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:02,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:02,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1959423737, now seen corresponding path program 243 times [2018-09-26 08:28:02,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3403 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:03,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:03,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:28:03,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:28:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:28:03,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:28:03,149 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2018-09-26 08:28:03,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:03,325 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2018-09-26 08:28:03,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:28:03,325 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-09-26 08:28:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:03,325 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:28:03,325 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:28:03,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:28:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:28:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-09-26 08:28:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-09-26 08:28:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2018-09-26 08:28:03,452 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 168 [2018-09-26 08:28:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:03,452 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2018-09-26 08:28:03,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:28:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2018-09-26 08:28:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-26 08:28:03,453 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:03,453 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1] [2018-09-26 08:28:03,453 INFO L423 AbstractCegarLoop]: === Iteration 247 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:03,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:03,453 INFO L82 PathProgramCache]: Analyzing trace with hash -612655225, now seen corresponding path program 244 times [2018-09-26 08:28:03,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:03,868 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:28:03,868 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:03,868 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:28:03,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:28:03,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:28:03,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:28:03,869 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 85 states. [2018-09-26 08:28:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:04,907 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-09-26 08:28:04,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:28:04,907 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 169 [2018-09-26 08:28:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:04,907 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:28:04,908 INFO L226 Difference]: Without dead ends: 254 [2018-09-26 08:28:04,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:28:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-26 08:28:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 172. [2018-09-26 08:28:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-26 08:28:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2018-09-26 08:28:05,056 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 169 [2018-09-26 08:28:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:05,056 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2018-09-26 08:28:05,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:28:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2018-09-26 08:28:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:28:05,056 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:05,057 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1, 1, 1] [2018-09-26 08:28:05,057 INFO L423 AbstractCegarLoop]: === Iteration 248 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:05,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:05,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1812504313, now seen corresponding path program 245 times [2018-09-26 08:28:05,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3486 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:05,345 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:05,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:28:05,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:28:05,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:28:05,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:28:05,346 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand 86 states. [2018-09-26 08:28:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:05,756 INFO L93 Difference]: Finished difference Result 258 states and 260 transitions. [2018-09-26 08:28:05,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:28:05,756 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-09-26 08:28:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:05,756 INFO L225 Difference]: With dead ends: 258 [2018-09-26 08:28:05,756 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:28:05,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:28:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:28:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:28:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:28:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-09-26 08:28:05,899 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 170 [2018-09-26 08:28:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:05,899 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-09-26 08:28:05,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:28:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-09-26 08:28:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:28:05,900 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:05,900 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1, 1, 1] [2018-09-26 08:28:05,900 INFO L423 AbstractCegarLoop]: === Iteration 249 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:05,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:05,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1504172755, now seen corresponding path program 246 times [2018-09-26 08:28:05,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3486 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:06,204 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:06,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:28:06,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:28:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:28:06,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:28:06,205 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2018-09-26 08:28:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:06,387 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2018-09-26 08:28:06,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:28:06,387 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-09-26 08:28:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:06,388 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:28:06,388 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 08:28:06,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:28:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 08:28:06,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-09-26 08:28:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-26 08:28:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-09-26 08:28:06,536 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 170 [2018-09-26 08:28:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:06,536 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-09-26 08:28:06,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:28:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-09-26 08:28:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-26 08:28:06,537 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:06,537 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1] [2018-09-26 08:28:06,537 INFO L423 AbstractCegarLoop]: === Iteration 250 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:06,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash 615223329, now seen corresponding path program 247 times [2018-09-26 08:28:06,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:07,002 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:28:07,003 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:07,003 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:28:07,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:28:07,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:28:07,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:28:07,004 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 86 states. [2018-09-26 08:28:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:08,037 INFO L93 Difference]: Finished difference Result 260 states and 262 transitions. [2018-09-26 08:28:08,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:28:08,037 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 171 [2018-09-26 08:28:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:08,038 INFO L225 Difference]: With dead ends: 260 [2018-09-26 08:28:08,038 INFO L226 Difference]: Without dead ends: 257 [2018-09-26 08:28:08,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:28:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-09-26 08:28:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 174. [2018-09-26 08:28:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 08:28:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 176 transitions. [2018-09-26 08:28:08,252 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 176 transitions. Word has length 171 [2018-09-26 08:28:08,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:08,252 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 176 transitions. [2018-09-26 08:28:08,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:28:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2018-09-26 08:28:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:28:08,252 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:08,252 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1, 1, 1] [2018-09-26 08:28:08,253 INFO L423 AbstractCegarLoop]: === Iteration 251 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:08,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:08,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1891992493, now seen corresponding path program 248 times [2018-09-26 08:28:08,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3570 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:08,509 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:08,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:28:08,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:28:08,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:28:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:28:08,510 INFO L87 Difference]: Start difference. First operand 174 states and 176 transitions. Second operand 87 states. [2018-09-26 08:28:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:08,881 INFO L93 Difference]: Finished difference Result 261 states and 263 transitions. [2018-09-26 08:28:08,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:28:08,882 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-09-26 08:28:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:08,882 INFO L225 Difference]: With dead ends: 261 [2018-09-26 08:28:08,882 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:28:08,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:28:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:28:09,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:28:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:28:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-09-26 08:28:09,011 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 172 [2018-09-26 08:28:09,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:09,011 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-09-26 08:28:09,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:28:09,011 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-09-26 08:28:09,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:28:09,012 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:09,012 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1, 1, 1] [2018-09-26 08:28:09,012 INFO L423 AbstractCegarLoop]: === Iteration 252 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:09,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1434631097, now seen corresponding path program 249 times [2018-09-26 08:28:09,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3570 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:09,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:09,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:28:09,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:28:09,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:28:09,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:28:09,270 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2018-09-26 08:28:09,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:09,433 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-09-26 08:28:09,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:28:09,433 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-09-26 08:28:09,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:09,434 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:28:09,434 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 08:28:09,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:28:09,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 08:28:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-09-26 08:28:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 08:28:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-09-26 08:28:09,565 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 172 [2018-09-26 08:28:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:09,566 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-09-26 08:28:09,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:28:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-09-26 08:28:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-26 08:28:09,566 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:09,566 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1] [2018-09-26 08:28:09,566 INFO L423 AbstractCegarLoop]: === Iteration 253 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:09,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:09,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1523952569, now seen corresponding path program 250 times [2018-09-26 08:28:09,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:09,957 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:28:09,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:09,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:28:09,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:28:09,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:28:09,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:28:09,958 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 87 states. [2018-09-26 08:28:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:10,908 INFO L93 Difference]: Finished difference Result 263 states and 265 transitions. [2018-09-26 08:28:10,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:28:10,909 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 173 [2018-09-26 08:28:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:10,909 INFO L225 Difference]: With dead ends: 263 [2018-09-26 08:28:10,909 INFO L226 Difference]: Without dead ends: 260 [2018-09-26 08:28:10,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:28:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-09-26 08:28:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 176. [2018-09-26 08:28:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 08:28:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2018-09-26 08:28:11,048 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 173 [2018-09-26 08:28:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:11,048 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2018-09-26 08:28:11,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:28:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2018-09-26 08:28:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:28:11,049 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:11,049 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1, 1, 1] [2018-09-26 08:28:11,049 INFO L423 AbstractCegarLoop]: === Iteration 254 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:11,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:11,049 INFO L82 PathProgramCache]: Analyzing trace with hash 2049095, now seen corresponding path program 251 times [2018-09-26 08:28:11,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3655 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:11,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:11,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:28:11,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:28:11,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:28:11,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:28:11,310 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 88 states. [2018-09-26 08:28:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:11,724 INFO L93 Difference]: Finished difference Result 264 states and 266 transitions. [2018-09-26 08:28:11,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:28:11,725 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-09-26 08:28:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:11,725 INFO L225 Difference]: With dead ends: 264 [2018-09-26 08:28:11,725 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:28:11,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:28:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:28:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:28:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:28:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-09-26 08:28:11,865 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 174 [2018-09-26 08:28:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:11,865 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-09-26 08:28:11,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:28:11,866 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-09-26 08:28:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:28:11,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:11,866 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1, 1, 1] [2018-09-26 08:28:11,867 INFO L423 AbstractCegarLoop]: === Iteration 255 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:11,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash -44067091, now seen corresponding path program 252 times [2018-09-26 08:28:11,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3655 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:12,192 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:12,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:28:12,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:28:12,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:28:12,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:28:12,193 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2018-09-26 08:28:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:12,400 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-09-26 08:28:12,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:28:12,400 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-09-26 08:28:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:12,401 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:28:12,401 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:28:12,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:28:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:28:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-09-26 08:28:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 08:28:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2018-09-26 08:28:12,535 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 174 [2018-09-26 08:28:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:12,535 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2018-09-26 08:28:12,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:28:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2018-09-26 08:28:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-26 08:28:12,536 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:12,536 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1] [2018-09-26 08:28:12,536 INFO L423 AbstractCegarLoop]: === Iteration 256 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:12,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1366141343, now seen corresponding path program 253 times [2018-09-26 08:28:12,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:12,947 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:28:12,948 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:12,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:28:12,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:28:12,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:28:12,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:28:12,949 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 88 states. [2018-09-26 08:28:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:14,022 INFO L93 Difference]: Finished difference Result 266 states and 268 transitions. [2018-09-26 08:28:14,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:28:14,022 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 175 [2018-09-26 08:28:14,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:14,023 INFO L225 Difference]: With dead ends: 266 [2018-09-26 08:28:14,023 INFO L226 Difference]: Without dead ends: 263 [2018-09-26 08:28:14,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:28:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-09-26 08:28:14,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 178. [2018-09-26 08:28:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-09-26 08:28:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2018-09-26 08:28:14,183 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 175 [2018-09-26 08:28:14,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:14,183 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2018-09-26 08:28:14,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:28:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2018-09-26 08:28:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:28:14,184 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:14,184 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1, 1, 1] [2018-09-26 08:28:14,185 INFO L423 AbstractCegarLoop]: === Iteration 257 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:14,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:14,185 INFO L82 PathProgramCache]: Analyzing trace with hash 599229805, now seen corresponding path program 254 times [2018-09-26 08:28:14,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3741 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:14,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:14,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:28:14,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:28:14,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:28:14,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:28:14,487 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 89 states. [2018-09-26 08:28:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:14,965 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2018-09-26 08:28:14,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:28:14,965 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-09-26 08:28:14,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:14,966 INFO L225 Difference]: With dead ends: 267 [2018-09-26 08:28:14,966 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:28:14,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:28:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:28:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:28:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:28:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-09-26 08:28:15,122 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 176 [2018-09-26 08:28:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:15,123 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-09-26 08:28:15,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:28:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-09-26 08:28:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:28:15,123 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:15,123 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1, 1, 1] [2018-09-26 08:28:15,124 INFO L423 AbstractCegarLoop]: === Iteration 258 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:15,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash -830371961, now seen corresponding path program 255 times [2018-09-26 08:28:15,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3741 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:15,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:15,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:28:15,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:28:15,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:28:15,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:28:15,449 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2018-09-26 08:28:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:15,648 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-09-26 08:28:15,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:28:15,649 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-09-26 08:28:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:15,650 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:28:15,650 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 08:28:15,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:28:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 08:28:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-09-26 08:28:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-09-26 08:28:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2018-09-26 08:28:15,861 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 176 [2018-09-26 08:28:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:15,862 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-09-26 08:28:15,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:28:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2018-09-26 08:28:15,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-26 08:28:15,862 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:15,862 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1] [2018-09-26 08:28:15,862 INFO L423 AbstractCegarLoop]: === Iteration 259 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:15,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:15,863 INFO L82 PathProgramCache]: Analyzing trace with hash 28211463, now seen corresponding path program 256 times [2018-09-26 08:28:15,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:16,370 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:28:16,370 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:16,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:28:16,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:28:16,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:28:16,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:28:16,371 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 89 states. [2018-09-26 08:28:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:17,466 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2018-09-26 08:28:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:28:17,466 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 177 [2018-09-26 08:28:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:17,467 INFO L225 Difference]: With dead ends: 269 [2018-09-26 08:28:17,467 INFO L226 Difference]: Without dead ends: 266 [2018-09-26 08:28:17,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:28:17,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-26 08:28:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 180. [2018-09-26 08:28:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-09-26 08:28:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-09-26 08:28:17,632 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 177 [2018-09-26 08:28:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:17,632 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-09-26 08:28:17,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:28:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-09-26 08:28:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:28:17,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:17,632 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1, 1, 1] [2018-09-26 08:28:17,633 INFO L423 AbstractCegarLoop]: === Iteration 260 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:17,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:17,633 INFO L82 PathProgramCache]: Analyzing trace with hash 874493831, now seen corresponding path program 257 times [2018-09-26 08:28:17,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3828 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:17,955 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:17,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:28:17,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:28:17,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:28:17,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:28:17,956 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 90 states. [2018-09-26 08:28:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:18,455 INFO L93 Difference]: Finished difference Result 270 states and 272 transitions. [2018-09-26 08:28:18,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:28:18,455 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-09-26 08:28:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:18,456 INFO L225 Difference]: With dead ends: 270 [2018-09-26 08:28:18,456 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:28:18,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:28:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:28:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:28:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:28:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-09-26 08:28:18,599 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 178 [2018-09-26 08:28:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:18,599 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-09-26 08:28:18,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:28:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-09-26 08:28:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:28:18,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:18,600 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1, 1, 1] [2018-09-26 08:28:18,600 INFO L423 AbstractCegarLoop]: === Iteration 261 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:18,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:18,600 INFO L82 PathProgramCache]: Analyzing trace with hash -493487955, now seen corresponding path program 258 times [2018-09-26 08:28:18,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3828 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:18,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:18,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:28:18,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:28:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:28:18,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:28:18,880 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2018-09-26 08:28:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:19,073 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2018-09-26 08:28:19,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:28:19,073 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-09-26 08:28:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:19,074 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:28:19,074 INFO L226 Difference]: Without dead ends: 180 [2018-09-26 08:28:19,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:28:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-26 08:28:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-09-26 08:28:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-09-26 08:28:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-09-26 08:28:19,217 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 178 [2018-09-26 08:28:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:19,218 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-09-26 08:28:19,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:28:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-09-26 08:28:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-26 08:28:19,218 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:19,218 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1] [2018-09-26 08:28:19,218 INFO L423 AbstractCegarLoop]: === Iteration 262 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:19,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:19,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1881681057, now seen corresponding path program 259 times [2018-09-26 08:28:19,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:19,693 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:28:19,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:19,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:28:19,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:28:19,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:28:19,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:28:19,694 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 90 states. [2018-09-26 08:28:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:20,793 INFO L93 Difference]: Finished difference Result 272 states and 274 transitions. [2018-09-26 08:28:20,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:28:20,793 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 179 [2018-09-26 08:28:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:20,794 INFO L225 Difference]: With dead ends: 272 [2018-09-26 08:28:20,794 INFO L226 Difference]: Without dead ends: 269 [2018-09-26 08:28:20,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:28:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-26 08:28:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 182. [2018-09-26 08:28:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 08:28:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2018-09-26 08:28:20,962 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 179 [2018-09-26 08:28:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:20,962 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2018-09-26 08:28:20,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:28:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2018-09-26 08:28:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:28:20,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:20,962 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1, 1, 1] [2018-09-26 08:28:20,963 INFO L423 AbstractCegarLoop]: === Iteration 263 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:20,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1797490899, now seen corresponding path program 260 times [2018-09-26 08:28:20,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3916 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:21,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:21,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:28:21,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:28:21,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:28:21,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:28:21,290 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 91 states. [2018-09-26 08:28:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:21,772 INFO L93 Difference]: Finished difference Result 273 states and 275 transitions. [2018-09-26 08:28:21,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:28:21,772 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-09-26 08:28:21,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:21,772 INFO L225 Difference]: With dead ends: 273 [2018-09-26 08:28:21,772 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:28:21,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:28:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:28:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:28:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:28:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-09-26 08:28:21,934 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 180 [2018-09-26 08:28:21,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:21,934 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-09-26 08:28:21,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:28:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-09-26 08:28:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:28:21,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:21,935 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1, 1, 1] [2018-09-26 08:28:21,935 INFO L423 AbstractCegarLoop]: === Iteration 264 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:21,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:21,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1255253305, now seen corresponding path program 261 times [2018-09-26 08:28:21,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3916 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:22,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:22,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:28:22,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:28:22,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:28:22,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:28:22,279 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2018-09-26 08:28:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:22,500 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2018-09-26 08:28:22,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:28:22,501 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-09-26 08:28:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:22,501 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:28:22,501 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 08:28:22,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:28:22,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 08:28:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-26 08:28:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 08:28:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-09-26 08:28:22,660 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 180 [2018-09-26 08:28:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:22,660 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-09-26 08:28:22,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:28:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-09-26 08:28:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-26 08:28:22,661 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:22,661 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1] [2018-09-26 08:28:22,661 INFO L423 AbstractCegarLoop]: === Iteration 265 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:22,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:22,661 INFO L82 PathProgramCache]: Analyzing trace with hash -258208313, now seen corresponding path program 262 times [2018-09-26 08:28:22,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:23,112 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:28:23,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:23,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:28:23,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:28:23,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:28:23,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:28:23,113 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 91 states. [2018-09-26 08:28:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:24,277 INFO L93 Difference]: Finished difference Result 275 states and 277 transitions. [2018-09-26 08:28:24,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:28:24,277 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 181 [2018-09-26 08:28:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:24,278 INFO L225 Difference]: With dead ends: 275 [2018-09-26 08:28:24,278 INFO L226 Difference]: Without dead ends: 272 [2018-09-26 08:28:24,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:28:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-09-26 08:28:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 184. [2018-09-26 08:28:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:28:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 186 transitions. [2018-09-26 08:28:24,451 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 186 transitions. Word has length 181 [2018-09-26 08:28:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:24,451 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 186 transitions. [2018-09-26 08:28:24,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:28:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 186 transitions. [2018-09-26 08:28:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:28:24,452 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:24,452 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1, 1, 1] [2018-09-26 08:28:24,452 INFO L423 AbstractCegarLoop]: === Iteration 266 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:24,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:24,452 INFO L82 PathProgramCache]: Analyzing trace with hash 585415367, now seen corresponding path program 263 times [2018-09-26 08:28:24,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 4005 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:24,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:24,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:28:24,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:28:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:28:24,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:28:24,797 INFO L87 Difference]: Start difference. First operand 184 states and 186 transitions. Second operand 92 states. [2018-09-26 08:28:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:25,269 INFO L93 Difference]: Finished difference Result 276 states and 278 transitions. [2018-09-26 08:28:25,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:28:25,269 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-09-26 08:28:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:25,269 INFO L225 Difference]: With dead ends: 276 [2018-09-26 08:28:25,269 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:28:25,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:28:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:28:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:28:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:28:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-09-26 08:28:25,416 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 182 [2018-09-26 08:28:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:25,416 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-09-26 08:28:25,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:28:25,417 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-09-26 08:28:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:28:25,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:25,417 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1, 1, 1] [2018-09-26 08:28:25,417 INFO L423 AbstractCegarLoop]: === Iteration 267 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:25,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash 214911597, now seen corresponding path program 264 times [2018-09-26 08:28:25,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 4005 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:25,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:25,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:28:25,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:28:25,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:28:25,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:28:25,715 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2018-09-26 08:28:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:25,901 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-09-26 08:28:25,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:28:25,901 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-09-26 08:28:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:25,901 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:28:25,901 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:28:25,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 89 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:28:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:28:26,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-09-26 08:28:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:28:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-09-26 08:28:26,050 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 182 [2018-09-26 08:28:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:26,050 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-09-26 08:28:26,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:28:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-09-26 08:28:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-26 08:28:26,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:26,051 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1] [2018-09-26 08:28:26,051 INFO L423 AbstractCegarLoop]: === Iteration 268 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:26,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:26,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1927736607, now seen corresponding path program 265 times [2018-09-26 08:28:26,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:26,498 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:28:26,498 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:26,498 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:28:26,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:28:26,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:28:26,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:28:26,499 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 92 states. [2018-09-26 08:28:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:27,671 INFO L93 Difference]: Finished difference Result 278 states and 280 transitions. [2018-09-26 08:28:27,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:28:27,671 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 183 [2018-09-26 08:28:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:27,672 INFO L225 Difference]: With dead ends: 278 [2018-09-26 08:28:27,672 INFO L226 Difference]: Without dead ends: 275 [2018-09-26 08:28:27,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:28:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-26 08:28:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 186. [2018-09-26 08:28:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-26 08:28:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2018-09-26 08:28:27,845 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 183 [2018-09-26 08:28:27,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:27,845 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2018-09-26 08:28:27,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:28:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2018-09-26 08:28:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:28:27,846 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:27,846 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1, 1, 1] [2018-09-26 08:28:27,846 INFO L423 AbstractCegarLoop]: === Iteration 269 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:27,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash 369645805, now seen corresponding path program 266 times [2018-09-26 08:28:27,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:28,192 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:28,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:28:28,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:28:28,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:28:28,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:28:28,194 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 93 states. [2018-09-26 08:28:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:28,631 INFO L93 Difference]: Finished difference Result 279 states and 281 transitions. [2018-09-26 08:28:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:28:28,632 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-09-26 08:28:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:28,632 INFO L225 Difference]: With dead ends: 279 [2018-09-26 08:28:28,632 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:28:28,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:28:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:28:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-09-26 08:28:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:28:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-09-26 08:28:28,795 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 184 [2018-09-26 08:28:28,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:28,795 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-09-26 08:28:28,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:28:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-09-26 08:28:28,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:28:28,796 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:28,796 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1, 1, 1] [2018-09-26 08:28:28,796 INFO L423 AbstractCegarLoop]: === Iteration 270 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:28,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:28,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1768930823, now seen corresponding path program 267 times [2018-09-26 08:28:28,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:29,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:29,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:28:29,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:28:29,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:28:29,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:28:29,150 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2018-09-26 08:28:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:29,381 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-09-26 08:28:29,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:28:29,381 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-09-26 08:28:29,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:29,382 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:28:29,382 INFO L226 Difference]: Without dead ends: 186 [2018-09-26 08:28:29,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:28:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-26 08:28:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-09-26 08:28:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-26 08:28:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-09-26 08:28:29,552 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 184 [2018-09-26 08:28:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:29,552 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-09-26 08:28:29,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:28:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-09-26 08:28:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-26 08:28:29,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:29,553 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1] [2018-09-26 08:28:29,553 INFO L423 AbstractCegarLoop]: === Iteration 271 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:29,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:29,553 INFO L82 PathProgramCache]: Analyzing trace with hash -997780857, now seen corresponding path program 268 times [2018-09-26 08:28:29,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:30,054 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:28:30,055 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:30,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:28:30,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:28:30,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:28:30,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:28:30,055 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 93 states. [2018-09-26 08:28:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:31,265 INFO L93 Difference]: Finished difference Result 281 states and 283 transitions. [2018-09-26 08:28:31,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:28:31,265 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 185 [2018-09-26 08:28:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:31,265 INFO L225 Difference]: With dead ends: 281 [2018-09-26 08:28:31,265 INFO L226 Difference]: Without dead ends: 278 [2018-09-26 08:28:31,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:28:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-26 08:28:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 188. [2018-09-26 08:28:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-09-26 08:28:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-09-26 08:28:31,442 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 185 [2018-09-26 08:28:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:31,443 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-09-26 08:28:31,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:28:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-09-26 08:28:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:28:31,443 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:31,443 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1, 1, 1] [2018-09-26 08:28:31,443 INFO L423 AbstractCegarLoop]: === Iteration 272 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:31,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:31,444 INFO L82 PathProgramCache]: Analyzing trace with hash -866497017, now seen corresponding path program 269 times [2018-09-26 08:28:31,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:31,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:31,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:28:31,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:28:31,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:28:31,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:28:31,793 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 94 states. [2018-09-26 08:28:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:32,360 INFO L93 Difference]: Finished difference Result 282 states and 284 transitions. [2018-09-26 08:28:32,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:28:32,360 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-09-26 08:28:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:32,360 INFO L225 Difference]: With dead ends: 282 [2018-09-26 08:28:32,360 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:28:32,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:28:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:28:32,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:28:32,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:28:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-09-26 08:28:32,535 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 186 [2018-09-26 08:28:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:32,536 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-09-26 08:28:32,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:28:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-09-26 08:28:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:28:32,536 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:32,536 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1, 1, 1] [2018-09-26 08:28:32,536 INFO L423 AbstractCegarLoop]: === Iteration 273 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:32,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:32,537 INFO L82 PathProgramCache]: Analyzing trace with hash -438334419, now seen corresponding path program 270 times [2018-09-26 08:28:32,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:32,901 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:32,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:28:32,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:28:32,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:28:32,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:28:32,902 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2018-09-26 08:28:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:33,123 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2018-09-26 08:28:33,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:28:33,123 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-09-26 08:28:33,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:33,124 INFO L225 Difference]: With dead ends: 191 [2018-09-26 08:28:33,124 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 08:28:33,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 91 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:28:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 08:28:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-09-26 08:28:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-09-26 08:28:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2018-09-26 08:28:33,302 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 186 [2018-09-26 08:28:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:33,303 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2018-09-26 08:28:33,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:28:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2018-09-26 08:28:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-26 08:28:33,303 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:33,303 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1, 1] [2018-09-26 08:28:33,303 INFO L423 AbstractCegarLoop]: === Iteration 274 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:33,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash -703526623, now seen corresponding path program 271 times [2018-09-26 08:28:33,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:33,842 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:28:33,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:33,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:28:33,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:28:33,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:28:33,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:28:33,843 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 94 states. [2018-09-26 08:28:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:35,088 INFO L93 Difference]: Finished difference Result 284 states and 286 transitions. [2018-09-26 08:28:35,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:28:35,088 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 187 [2018-09-26 08:28:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:35,089 INFO L225 Difference]: With dead ends: 284 [2018-09-26 08:28:35,089 INFO L226 Difference]: Without dead ends: 281 [2018-09-26 08:28:35,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:28:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-09-26 08:28:35,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 190. [2018-09-26 08:28:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-09-26 08:28:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 192 transitions. [2018-09-26 08:28:35,270 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 192 transitions. Word has length 187 [2018-09-26 08:28:35,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:35,270 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 192 transitions. [2018-09-26 08:28:35,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:28:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 192 transitions. [2018-09-26 08:28:35,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:28:35,271 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:35,271 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1, 1, 1] [2018-09-26 08:28:35,271 INFO L423 AbstractCegarLoop]: === Iteration 275 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:35,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:35,271 INFO L82 PathProgramCache]: Analyzing trace with hash -334550355, now seen corresponding path program 272 times [2018-09-26 08:28:35,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4278 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:35,626 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:35,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:28:35,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:28:35,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:28:35,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:28:35,627 INFO L87 Difference]: Start difference. First operand 190 states and 192 transitions. Second operand 95 states. [2018-09-26 08:28:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:36,081 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions. [2018-09-26 08:28:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:28:36,082 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-09-26 08:28:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:36,082 INFO L225 Difference]: With dead ends: 285 [2018-09-26 08:28:36,082 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:28:36,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:28:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:28:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-09-26 08:28:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:28:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-09-26 08:28:36,238 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 188 [2018-09-26 08:28:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:36,239 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-09-26 08:28:36,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:28:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-09-26 08:28:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:28:36,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:36,239 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1, 1, 1] [2018-09-26 08:28:36,239 INFO L423 AbstractCegarLoop]: === Iteration 276 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:36,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:36,240 INFO L82 PathProgramCache]: Analyzing trace with hash 53588295, now seen corresponding path program 273 times [2018-09-26 08:28:36,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4278 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:36,568 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:36,568 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:28:36,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:28:36,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:28:36,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:28:36,569 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2018-09-26 08:28:36,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:36,778 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-09-26 08:28:36,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:28:36,779 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-09-26 08:28:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:36,779 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:28:36,779 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 08:28:36,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 92 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:28:36,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 08:28:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-09-26 08:28:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-09-26 08:28:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-09-26 08:28:36,939 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 188 [2018-09-26 08:28:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:36,939 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-09-26 08:28:36,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:28:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-09-26 08:28:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-26 08:28:36,939 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:36,940 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1, 1] [2018-09-26 08:28:36,940 INFO L423 AbstractCegarLoop]: === Iteration 277 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:36,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:36,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1661175623, now seen corresponding path program 274 times [2018-09-26 08:28:36,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:37,488 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:28:37,489 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:37,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:28:37,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:28:37,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:28:37,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:28:37,489 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 95 states. [2018-09-26 08:28:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:38,687 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2018-09-26 08:28:38,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:28:38,687 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 189 [2018-09-26 08:28:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:38,688 INFO L225 Difference]: With dead ends: 287 [2018-09-26 08:28:38,688 INFO L226 Difference]: Without dead ends: 284 [2018-09-26 08:28:38,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:28:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-26 08:28:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 192. [2018-09-26 08:28:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-09-26 08:28:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2018-09-26 08:28:38,852 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 189 [2018-09-26 08:28:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:38,852 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2018-09-26 08:28:38,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:28:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2018-09-26 08:28:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:28:38,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:38,853 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1, 1, 1] [2018-09-26 08:28:38,853 INFO L423 AbstractCegarLoop]: === Iteration 278 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:38,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:38,853 INFO L82 PathProgramCache]: Analyzing trace with hash -43224761, now seen corresponding path program 275 times [2018-09-26 08:28:38,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:39,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 4371 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:39,158 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:39,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:28:39,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:28:39,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:28:39,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:28:39,159 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 96 states. [2018-09-26 08:28:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:39,674 INFO L93 Difference]: Finished difference Result 288 states and 290 transitions. [2018-09-26 08:28:39,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:28:39,674 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-09-26 08:28:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:39,674 INFO L225 Difference]: With dead ends: 288 [2018-09-26 08:28:39,674 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:28:39,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:28:39,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:28:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-26 08:28:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:28:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-09-26 08:28:39,834 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 190 [2018-09-26 08:28:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:39,834 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-09-26 08:28:39,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:28:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-09-26 08:28:39,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:28:39,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:39,835 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1, 1, 1] [2018-09-26 08:28:39,835 INFO L423 AbstractCegarLoop]: === Iteration 279 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:39,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:39,835 INFO L82 PathProgramCache]: Analyzing trace with hash -895828499, now seen corresponding path program 276 times [2018-09-26 08:28:39,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 4371 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:40,154 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:40,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:28:40,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:28:40,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:28:40,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:28:40,155 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2018-09-26 08:28:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:40,359 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-09-26 08:28:40,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:28:40,359 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-09-26 08:28:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:40,359 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:28:40,359 INFO L226 Difference]: Without dead ends: 192 [2018-09-26 08:28:40,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 93 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:28:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-26 08:28:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-09-26 08:28:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-09-26 08:28:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2018-09-26 08:28:40,519 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 190 [2018-09-26 08:28:40,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:40,520 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2018-09-26 08:28:40,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:28:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2018-09-26 08:28:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-26 08:28:40,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:40,520 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1, 1] [2018-09-26 08:28:40,520 INFO L423 AbstractCegarLoop]: === Iteration 280 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:40,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:40,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2000941215, now seen corresponding path program 277 times [2018-09-26 08:28:40,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:40,998 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:28:40,998 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:40,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:28:40,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:28:40,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:28:40,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:28:40,999 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 96 states. [2018-09-26 08:28:42,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:42,241 INFO L93 Difference]: Finished difference Result 290 states and 292 transitions. [2018-09-26 08:28:42,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:28:42,241 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 191 [2018-09-26 08:28:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:42,242 INFO L225 Difference]: With dead ends: 290 [2018-09-26 08:28:42,242 INFO L226 Difference]: Without dead ends: 287 [2018-09-26 08:28:42,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:28:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-09-26 08:28:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 194. [2018-09-26 08:28:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:28:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 196 transitions. [2018-09-26 08:28:42,425 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 196 transitions. Word has length 191 [2018-09-26 08:28:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:42,425 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 196 transitions. [2018-09-26 08:28:42,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:28:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 196 transitions. [2018-09-26 08:28:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:28:42,426 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:42,426 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1, 1, 1] [2018-09-26 08:28:42,426 INFO L423 AbstractCegarLoop]: === Iteration 281 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:42,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:42,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1899697043, now seen corresponding path program 278 times [2018-09-26 08:28:42,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 4465 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:42,801 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:42,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:28:42,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:28:42,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:28:42,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:28:42,803 INFO L87 Difference]: Start difference. First operand 194 states and 196 transitions. Second operand 97 states. [2018-09-26 08:28:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:43,369 INFO L93 Difference]: Finished difference Result 291 states and 293 transitions. [2018-09-26 08:28:43,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:28:43,369 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-09-26 08:28:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:43,370 INFO L225 Difference]: With dead ends: 291 [2018-09-26 08:28:43,370 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:28:43,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:28:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:28:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 08:28:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:28:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-09-26 08:28:43,554 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 192 [2018-09-26 08:28:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:43,554 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-09-26 08:28:43,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:28:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-09-26 08:28:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:28:43,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:43,555 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1, 1, 1] [2018-09-26 08:28:43,555 INFO L423 AbstractCegarLoop]: === Iteration 282 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:43,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:43,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1734358151, now seen corresponding path program 279 times [2018-09-26 08:28:43,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 4465 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:43,947 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:43,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:28:43,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:28:43,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:28:43,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:28:43,949 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2018-09-26 08:28:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:44,204 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-09-26 08:28:44,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:28:44,205 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-09-26 08:28:44,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:44,205 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:28:44,205 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 08:28:44,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:28:44,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 08:28:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-09-26 08:28:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:28:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-09-26 08:28:44,391 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 192 [2018-09-26 08:28:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:44,392 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-09-26 08:28:44,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:28:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-09-26 08:28:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-09-26 08:28:44,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:44,392 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1] [2018-09-26 08:28:44,392 INFO L423 AbstractCegarLoop]: === Iteration 283 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:44,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:44,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2069533689, now seen corresponding path program 280 times [2018-09-26 08:28:44,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:44,965 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:28:44,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:44,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:28:44,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:28:44,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:28:44,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:28:44,966 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 97 states. [2018-09-26 08:28:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:46,279 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2018-09-26 08:28:46,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:28:46,279 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 193 [2018-09-26 08:28:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:46,280 INFO L225 Difference]: With dead ends: 293 [2018-09-26 08:28:46,280 INFO L226 Difference]: Without dead ends: 290 [2018-09-26 08:28:46,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:28:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-26 08:28:46,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 196. [2018-09-26 08:28:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 08:28:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2018-09-26 08:28:46,473 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 193 [2018-09-26 08:28:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:46,474 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2018-09-26 08:28:46,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:28:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2018-09-26 08:28:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:28:46,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:46,474 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1, 1, 1] [2018-09-26 08:28:46,474 INFO L423 AbstractCegarLoop]: === Iteration 284 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:46,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:46,475 INFO L82 PathProgramCache]: Analyzing trace with hash 268903559, now seen corresponding path program 281 times [2018-09-26 08:28:46,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:46,880 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:46,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:28:46,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:28:46,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:28:46,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:28:46,881 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 98 states. [2018-09-26 08:28:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:47,475 INFO L93 Difference]: Finished difference Result 294 states and 296 transitions. [2018-09-26 08:28:47,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:28:47,475 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-09-26 08:28:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:47,476 INFO L225 Difference]: With dead ends: 294 [2018-09-26 08:28:47,476 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:28:47,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:28:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:28:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-26 08:28:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:28:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-09-26 08:28:47,663 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 194 [2018-09-26 08:28:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:47,663 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-09-26 08:28:47,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:28:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-09-26 08:28:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:28:47,664 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:47,664 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1, 1, 1] [2018-09-26 08:28:47,664 INFO L423 AbstractCegarLoop]: === Iteration 285 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:47,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:47,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1255464877, now seen corresponding path program 282 times [2018-09-26 08:28:47,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:48,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:48,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:28:48,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:28:48,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:28:48,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:28:48,070 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2018-09-26 08:28:48,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:48,325 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2018-09-26 08:28:48,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:28:48,325 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-09-26 08:28:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:48,325 INFO L225 Difference]: With dead ends: 199 [2018-09-26 08:28:48,325 INFO L226 Difference]: Without dead ends: 196 [2018-09-26 08:28:48,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:28:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-09-26 08:28:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-09-26 08:28:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 08:28:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-09-26 08:28:48,517 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 194 [2018-09-26 08:28:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:48,517 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-09-26 08:28:48,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:28:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-09-26 08:28:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-26 08:28:48,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:48,518 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1, 1] [2018-09-26 08:28:48,518 INFO L423 AbstractCegarLoop]: === Iteration 286 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:48,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:48,519 INFO L82 PathProgramCache]: Analyzing trace with hash 264644001, now seen corresponding path program 283 times [2018-09-26 08:28:48,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:49,192 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:28:49,192 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:49,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:28:49,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:28:49,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:28:49,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:28:49,193 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 98 states. [2018-09-26 08:28:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:50,512 INFO L93 Difference]: Finished difference Result 296 states and 298 transitions. [2018-09-26 08:28:50,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:28:50,512 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 195 [2018-09-26 08:28:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:50,513 INFO L225 Difference]: With dead ends: 296 [2018-09-26 08:28:50,513 INFO L226 Difference]: Without dead ends: 293 [2018-09-26 08:28:50,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:28:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-09-26 08:28:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 198. [2018-09-26 08:28:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-26 08:28:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 200 transitions. [2018-09-26 08:28:50,708 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 200 transitions. Word has length 195 [2018-09-26 08:28:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:50,708 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 200 transitions. [2018-09-26 08:28:50,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:28:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 200 transitions. [2018-09-26 08:28:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:28:50,708 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:50,708 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1, 1, 1] [2018-09-26 08:28:50,709 INFO L423 AbstractCegarLoop]: === Iteration 287 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:50,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:50,709 INFO L82 PathProgramCache]: Analyzing trace with hash -386032083, now seen corresponding path program 284 times [2018-09-26 08:28:50,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 4656 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:51,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:51,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:28:51,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:28:51,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:28:51,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:28:51,104 INFO L87 Difference]: Start difference. First operand 198 states and 200 transitions. Second operand 99 states. [2018-09-26 08:28:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:51,718 INFO L93 Difference]: Finished difference Result 297 states and 299 transitions. [2018-09-26 08:28:51,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:28:51,718 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-09-26 08:28:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:51,719 INFO L225 Difference]: With dead ends: 297 [2018-09-26 08:28:51,719 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:28:51,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:28:51,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:28:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-26 08:28:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:28:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-09-26 08:28:51,911 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 196 [2018-09-26 08:28:51,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:51,911 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-09-26 08:28:51,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:28:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-09-26 08:28:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:28:51,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:51,912 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1, 1, 1] [2018-09-26 08:28:51,912 INFO L423 AbstractCegarLoop]: === Iteration 288 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:51,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:51,912 INFO L82 PathProgramCache]: Analyzing trace with hash 132597703, now seen corresponding path program 285 times [2018-09-26 08:28:51,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 4656 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:52,322 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:52,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:28:52,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:28:52,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:28:52,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:28:52,323 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2018-09-26 08:28:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:52,571 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-09-26 08:28:52,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:28:52,571 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-09-26 08:28:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:52,571 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:28:52,572 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 08:28:52,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:28:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 08:28:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-09-26 08:28:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-26 08:28:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2018-09-26 08:28:52,785 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 196 [2018-09-26 08:28:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:52,786 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2018-09-26 08:28:52,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:28:52,786 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2018-09-26 08:28:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-09-26 08:28:52,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:52,786 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1, 1] [2018-09-26 08:28:52,786 INFO L423 AbstractCegarLoop]: === Iteration 289 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:52,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:52,787 INFO L82 PathProgramCache]: Analyzing trace with hash -184500025, now seen corresponding path program 286 times [2018-09-26 08:28:52,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:53,398 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:28:53,399 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:53,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:28:53,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:28:53,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:28:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:28:53,400 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 99 states. [2018-09-26 08:28:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:54,757 INFO L93 Difference]: Finished difference Result 299 states and 301 transitions. [2018-09-26 08:28:54,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:28:54,757 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 197 [2018-09-26 08:28:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:54,758 INFO L225 Difference]: With dead ends: 299 [2018-09-26 08:28:54,758 INFO L226 Difference]: Without dead ends: 296 [2018-09-26 08:28:54,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:28:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-09-26 08:28:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 200. [2018-09-26 08:28:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-26 08:28:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2018-09-26 08:28:55,072 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 197 [2018-09-26 08:28:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:55,072 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2018-09-26 08:28:55,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:28:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2018-09-26 08:28:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:28:55,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:55,073 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1, 1, 1] [2018-09-26 08:28:55,073 INFO L423 AbstractCegarLoop]: === Iteration 290 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:55,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:55,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1424595001, now seen corresponding path program 287 times [2018-09-26 08:28:55,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 4753 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:55,480 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:55,480 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:28:55,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:28:55,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:28:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:28:55,481 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand 100 states. [2018-09-26 08:28:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:56,040 INFO L93 Difference]: Finished difference Result 300 states and 302 transitions. [2018-09-26 08:28:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:28:56,041 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-09-26 08:28:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:56,041 INFO L225 Difference]: With dead ends: 300 [2018-09-26 08:28:56,041 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:28:56,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:28:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:28:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-26 08:28:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:28:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-09-26 08:28:56,216 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 198 [2018-09-26 08:28:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:56,216 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-09-26 08:28:56,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:28:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-09-26 08:28:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:28:56,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:56,216 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1, 1, 1] [2018-09-26 08:28:56,217 INFO L423 AbstractCegarLoop]: === Iteration 291 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:56,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:56,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1768026477, now seen corresponding path program 288 times [2018-09-26 08:28:56,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 4753 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:56,586 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:56,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:28:56,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:28:56,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:28:56,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:28:56,587 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2018-09-26 08:28:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:56,824 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2018-09-26 08:28:56,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:28:56,825 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-09-26 08:28:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:56,825 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:28:56,825 INFO L226 Difference]: Without dead ends: 200 [2018-09-26 08:28:56,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:28:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-26 08:28:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-26 08:28:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-26 08:28:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-09-26 08:28:57,001 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 198 [2018-09-26 08:28:57,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:57,001 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-09-26 08:28:57,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:28:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-09-26 08:28:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-26 08:28:57,002 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:57,002 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1, 1] [2018-09-26 08:28:57,002 INFO L423 AbstractCegarLoop]: === Iteration 292 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:57,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1025815583, now seen corresponding path program 289 times [2018-09-26 08:28:57,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:57,540 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:28:57,540 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:57,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:28:57,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:28:57,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:28:57,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:28:57,541 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 100 states. [2018-09-26 08:28:58,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:58,835 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2018-09-26 08:28:58,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:28:58,835 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 199 [2018-09-26 08:28:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:58,835 INFO L225 Difference]: With dead ends: 302 [2018-09-26 08:28:58,835 INFO L226 Difference]: Without dead ends: 299 [2018-09-26 08:28:58,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:28:58,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-26 08:28:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 202. [2018-09-26 08:28:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 08:28:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 204 transitions. [2018-09-26 08:28:59,019 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 204 transitions. Word has length 199 [2018-09-26 08:28:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:59,019 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 204 transitions. [2018-09-26 08:28:59,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:28:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 204 transitions. [2018-09-26 08:28:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:28:59,020 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:59,020 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1, 1, 1] [2018-09-26 08:28:59,020 INFO L423 AbstractCegarLoop]: === Iteration 293 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:59,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1735573523, now seen corresponding path program 290 times [2018-09-26 08:28:59,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4851 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:59,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:59,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:28:59,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:28:59,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:28:59,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:28:59,422 INFO L87 Difference]: Start difference. First operand 202 states and 204 transitions. Second operand 101 states. [2018-09-26 08:29:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:00,004 INFO L93 Difference]: Finished difference Result 303 states and 305 transitions. [2018-09-26 08:29:00,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:29:00,004 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-09-26 08:29:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:00,005 INFO L225 Difference]: With dead ends: 303 [2018-09-26 08:29:00,005 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:29:00,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:29:00,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:29:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-09-26 08:29:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:29:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-09-26 08:29:00,183 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 200 [2018-09-26 08:29:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:00,184 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-09-26 08:29:00,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:29:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-09-26 08:29:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:29:00,184 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:00,185 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1, 1, 1] [2018-09-26 08:29:00,185 INFO L423 AbstractCegarLoop]: === Iteration 294 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:00,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1548555513, now seen corresponding path program 291 times [2018-09-26 08:29:00,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4851 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:00,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:00,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:29:00,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:29:00,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:29:00,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:29:00,565 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2018-09-26 08:29:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:00,795 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2018-09-26 08:29:00,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:29:00,796 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-09-26 08:29:00,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:00,796 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:29:00,796 INFO L226 Difference]: Without dead ends: 202 [2018-09-26 08:29:00,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:29:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-26 08:29:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-09-26 08:29:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 08:29:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2018-09-26 08:29:00,982 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 200 [2018-09-26 08:29:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:00,982 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2018-09-26 08:29:00,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:29:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2018-09-26 08:29:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-26 08:29:00,983 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:00,983 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1, 1] [2018-09-26 08:29:00,983 INFO L423 AbstractCegarLoop]: === Iteration 295 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:00,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:00,983 INFO L82 PathProgramCache]: Analyzing trace with hash -760642169, now seen corresponding path program 292 times [2018-09-26 08:29:00,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:01,521 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:29:01,521 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:01,521 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:29:01,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:29:01,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:29:01,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:29:01,522 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 101 states. [2018-09-26 08:29:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:02,888 INFO L93 Difference]: Finished difference Result 305 states and 307 transitions. [2018-09-26 08:29:02,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:29:02,888 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 201 [2018-09-26 08:29:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:02,889 INFO L225 Difference]: With dead ends: 305 [2018-09-26 08:29:02,889 INFO L226 Difference]: Without dead ends: 302 [2018-09-26 08:29:02,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:29:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-26 08:29:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 204. [2018-09-26 08:29:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-09-26 08:29:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 206 transitions. [2018-09-26 08:29:03,083 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 206 transitions. Word has length 201 [2018-09-26 08:29:03,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:03,083 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 206 transitions. [2018-09-26 08:29:03,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:29:03,083 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 206 transitions. [2018-09-26 08:29:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:29:03,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:03,083 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1, 1, 1] [2018-09-26 08:29:03,084 INFO L423 AbstractCegarLoop]: === Iteration 296 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:03,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2105132281, now seen corresponding path program 293 times [2018-09-26 08:29:03,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:03,519 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:03,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:29:03,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:29:03,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:29:03,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:29:03,520 INFO L87 Difference]: Start difference. First operand 204 states and 206 transitions. Second operand 102 states. [2018-09-26 08:29:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:04,073 INFO L93 Difference]: Finished difference Result 306 states and 308 transitions. [2018-09-26 08:29:04,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:29:04,073 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-09-26 08:29:04,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:04,074 INFO L225 Difference]: With dead ends: 306 [2018-09-26 08:29:04,074 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:29:04,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:29:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:29:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:29:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:29:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-09-26 08:29:04,277 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 202 [2018-09-26 08:29:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:04,277 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-09-26 08:29:04,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:29:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-09-26 08:29:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:29:04,277 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:04,277 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1, 1, 1] [2018-09-26 08:29:04,278 INFO L423 AbstractCegarLoop]: === Iteration 297 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:04,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:04,278 INFO L82 PathProgramCache]: Analyzing trace with hash -602541267, now seen corresponding path program 294 times [2018-09-26 08:29:04,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:04,650 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:04,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:29:04,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:29:04,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:29:04,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:29:04,651 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2018-09-26 08:29:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:04,890 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-09-26 08:29:04,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:29:04,890 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-09-26 08:29:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:04,891 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:29:04,891 INFO L226 Difference]: Without dead ends: 204 [2018-09-26 08:29:04,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:29:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-26 08:29:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-09-26 08:29:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-09-26 08:29:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2018-09-26 08:29:05,074 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 202 [2018-09-26 08:29:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:05,074 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2018-09-26 08:29:05,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:29:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2018-09-26 08:29:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-26 08:29:05,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:05,074 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1, 1] [2018-09-26 08:29:05,074 INFO L423 AbstractCegarLoop]: === Iteration 298 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:05,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:05,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1498971615, now seen corresponding path program 295 times [2018-09-26 08:29:05,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:05,687 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:29:05,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:05,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:29:05,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:29:05,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:29:05,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:29:05,688 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 102 states. [2018-09-26 08:29:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:06,979 INFO L93 Difference]: Finished difference Result 308 states and 310 transitions. [2018-09-26 08:29:06,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:29:06,979 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 203 [2018-09-26 08:29:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:06,980 INFO L225 Difference]: With dead ends: 308 [2018-09-26 08:29:06,980 INFO L226 Difference]: Without dead ends: 305 [2018-09-26 08:29:06,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:29:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-09-26 08:29:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 206. [2018-09-26 08:29:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 08:29:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2018-09-26 08:29:07,169 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 203 [2018-09-26 08:29:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:07,170 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2018-09-26 08:29:07,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:29:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2018-09-26 08:29:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:29:07,170 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:07,170 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1, 1, 1] [2018-09-26 08:29:07,170 INFO L423 AbstractCegarLoop]: === Iteration 299 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:07,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:07,170 INFO L82 PathProgramCache]: Analyzing trace with hash 776458669, now seen corresponding path program 296 times [2018-09-26 08:29:07,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 5050 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:07,591 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:07,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:29:07,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:29:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:29:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:29:07,592 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 103 states. [2018-09-26 08:29:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:08,171 INFO L93 Difference]: Finished difference Result 309 states and 311 transitions. [2018-09-26 08:29:08,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:29:08,171 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-09-26 08:29:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:08,172 INFO L225 Difference]: With dead ends: 309 [2018-09-26 08:29:08,172 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:29:08,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:29:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:29:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:29:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:29:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-09-26 08:29:08,363 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 204 [2018-09-26 08:29:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:08,363 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-09-26 08:29:08,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:29:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-09-26 08:29:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:29:08,364 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:08,364 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1, 1, 1] [2018-09-26 08:29:08,364 INFO L423 AbstractCegarLoop]: === Iteration 300 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:08,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:08,364 INFO L82 PathProgramCache]: Analyzing trace with hash 112139847, now seen corresponding path program 297 times [2018-09-26 08:29:08,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 5050 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:08,767 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:08,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:29:08,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:29:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:29:08,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:29:08,768 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2018-09-26 08:29:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:09,039 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-09-26 08:29:09,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:29:09,040 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-09-26 08:29:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:09,040 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:29:09,040 INFO L226 Difference]: Without dead ends: 206 [2018-09-26 08:29:09,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:29:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-26 08:29:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-09-26 08:29:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 08:29:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2018-09-26 08:29:09,227 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 204 [2018-09-26 08:29:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:09,227 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2018-09-26 08:29:09,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:29:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2018-09-26 08:29:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-26 08:29:09,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:09,228 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1] [2018-09-26 08:29:09,228 INFO L423 AbstractCegarLoop]: === Iteration 301 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:09,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash -818693561, now seen corresponding path program 298 times [2018-09-26 08:29:09,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:09,817 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:29:09,817 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:09,817 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:29:09,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:29:09,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:29:09,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:29:09,818 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 103 states. [2018-09-26 08:29:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:11,205 INFO L93 Difference]: Finished difference Result 311 states and 313 transitions. [2018-09-26 08:29:11,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:29:11,205 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 205 [2018-09-26 08:29:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:11,205 INFO L225 Difference]: With dead ends: 311 [2018-09-26 08:29:11,205 INFO L226 Difference]: Without dead ends: 308 [2018-09-26 08:29:11,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:29:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-09-26 08:29:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 208. [2018-09-26 08:29:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-09-26 08:29:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 210 transitions. [2018-09-26 08:29:11,400 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 210 transitions. Word has length 205 [2018-09-26 08:29:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:11,400 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 210 transitions. [2018-09-26 08:29:11,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:29:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 210 transitions. [2018-09-26 08:29:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:29:11,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:11,400 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1, 1, 1] [2018-09-26 08:29:11,401 INFO L423 AbstractCegarLoop]: === Iteration 302 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:11,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:11,401 INFO L82 PathProgramCache]: Analyzing trace with hash 390241863, now seen corresponding path program 299 times [2018-09-26 08:29:11,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 5151 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:11,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:11,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:29:11,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:29:11,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:29:11,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:29:11,833 INFO L87 Difference]: Start difference. First operand 208 states and 210 transitions. Second operand 104 states. [2018-09-26 08:29:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:12,353 INFO L93 Difference]: Finished difference Result 312 states and 314 transitions. [2018-09-26 08:29:12,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:29:12,354 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-09-26 08:29:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:12,354 INFO L225 Difference]: With dead ends: 312 [2018-09-26 08:29:12,354 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:29:12,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:29:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:29:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-09-26 08:29:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:29:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-09-26 08:29:12,607 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 206 [2018-09-26 08:29:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:12,607 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-09-26 08:29:12,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:29:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-09-26 08:29:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:29:12,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:12,608 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1, 1, 1] [2018-09-26 08:29:12,608 INFO L423 AbstractCegarLoop]: === Iteration 303 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:12,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:12,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1271194861, now seen corresponding path program 300 times [2018-09-26 08:29:12,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 5151 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:13,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:13,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:29:13,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:29:13,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:29:13,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:29:13,051 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2018-09-26 08:29:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:13,342 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2018-09-26 08:29:13,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:29:13,342 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-09-26 08:29:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:13,342 INFO L225 Difference]: With dead ends: 211 [2018-09-26 08:29:13,342 INFO L226 Difference]: Without dead ends: 208 [2018-09-26 08:29:13,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:29:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-09-26 08:29:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-09-26 08:29:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-09-26 08:29:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2018-09-26 08:29:13,538 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 206 [2018-09-26 08:29:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:13,539 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2018-09-26 08:29:13,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:29:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2018-09-26 08:29:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-26 08:29:13,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:13,539 INFO L375 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1, 1] [2018-09-26 08:29:13,539 INFO L423 AbstractCegarLoop]: === Iteration 304 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:13,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash 752273505, now seen corresponding path program 301 times [2018-09-26 08:29:13,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:14,143 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:29:14,143 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:14,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:29:14,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:29:14,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:29:14,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:29:14,144 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 104 states. [2018-09-26 08:29:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:15,755 INFO L93 Difference]: Finished difference Result 314 states and 316 transitions. [2018-09-26 08:29:15,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:29:15,755 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 207 [2018-09-26 08:29:15,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:15,756 INFO L225 Difference]: With dead ends: 314 [2018-09-26 08:29:15,756 INFO L226 Difference]: Without dead ends: 311 [2018-09-26 08:29:15,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:29:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-09-26 08:29:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 210. [2018-09-26 08:29:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-26 08:29:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2018-09-26 08:29:15,981 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 207 [2018-09-26 08:29:15,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:15,981 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2018-09-26 08:29:15,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:29:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2018-09-26 08:29:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:29:15,982 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:15,982 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1, 1, 1] [2018-09-26 08:29:15,982 INFO L423 AbstractCegarLoop]: === Iteration 305 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:15,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1845580653, now seen corresponding path program 302 times [2018-09-26 08:29:15,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 5253 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:16,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:16,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:29:16,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:29:16,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:29:16,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:29:16,487 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 105 states. [2018-09-26 08:29:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:17,206 INFO L93 Difference]: Finished difference Result 315 states and 317 transitions. [2018-09-26 08:29:17,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:29:17,206 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-09-26 08:29:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:17,207 INFO L225 Difference]: With dead ends: 315 [2018-09-26 08:29:17,207 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:29:17,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:29:17,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:29:17,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-09-26 08:29:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:29:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-09-26 08:29:17,427 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 208 [2018-09-26 08:29:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:17,427 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-09-26 08:29:17,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:29:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-09-26 08:29:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:29:17,428 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:17,428 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1, 1, 1] [2018-09-26 08:29:17,428 INFO L423 AbstractCegarLoop]: === Iteration 306 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:17,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:17,429 INFO L82 PathProgramCache]: Analyzing trace with hash -909647481, now seen corresponding path program 303 times [2018-09-26 08:29:17,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 5253 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:17,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:17,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:29:17,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:29:17,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:29:17,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:29:17,924 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2018-09-26 08:29:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:18,168 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-09-26 08:29:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:29:18,168 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-09-26 08:29:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:18,168 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:29:18,168 INFO L226 Difference]: Without dead ends: 210 [2018-09-26 08:29:18,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 102 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:29:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-26 08:29:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-09-26 08:29:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-26 08:29:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-09-26 08:29:18,363 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 208 [2018-09-26 08:29:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:18,363 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-09-26 08:29:18,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:29:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-09-26 08:29:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-09-26 08:29:18,364 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:18,364 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1, 1] [2018-09-26 08:29:18,364 INFO L423 AbstractCegarLoop]: === Iteration 307 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:18,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1865637639, now seen corresponding path program 304 times [2018-09-26 08:29:18,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:18,974 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:29:18,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:18,974 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:29:18,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:29:18,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:29:18,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:29:18,975 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 105 states. [2018-09-26 08:29:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:20,382 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2018-09-26 08:29:20,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:29:20,382 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 209 [2018-09-26 08:29:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:20,382 INFO L225 Difference]: With dead ends: 317 [2018-09-26 08:29:20,382 INFO L226 Difference]: Without dead ends: 314 [2018-09-26 08:29:20,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:29:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-09-26 08:29:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 212. [2018-09-26 08:29:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-26 08:29:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 214 transitions. [2018-09-26 08:29:20,585 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 214 transitions. Word has length 209 [2018-09-26 08:29:20,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:20,585 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 214 transitions. [2018-09-26 08:29:20,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:29:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2018-09-26 08:29:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:29:20,585 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:20,585 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1, 1, 1] [2018-09-26 08:29:20,586 INFO L423 AbstractCegarLoop]: === Iteration 308 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:20,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:20,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2000130439, now seen corresponding path program 305 times [2018-09-26 08:29:20,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 5356 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:21,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:21,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:29:21,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:29:21,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:29:21,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:29:21,006 INFO L87 Difference]: Start difference. First operand 212 states and 214 transitions. Second operand 106 states. [2018-09-26 08:29:21,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:21,632 INFO L93 Difference]: Finished difference Result 318 states and 320 transitions. [2018-09-26 08:29:21,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:29:21,632 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-09-26 08:29:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:21,633 INFO L225 Difference]: With dead ends: 318 [2018-09-26 08:29:21,633 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:29:21,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:29:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:29:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-26 08:29:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:29:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-09-26 08:29:21,830 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 210 [2018-09-26 08:29:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:21,830 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-09-26 08:29:21,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:29:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-09-26 08:29:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:29:21,830 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:21,831 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1, 1, 1] [2018-09-26 08:29:21,831 INFO L423 AbstractCegarLoop]: === Iteration 309 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:21,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:21,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1807563091, now seen corresponding path program 306 times [2018-09-26 08:29:21,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 5356 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:22,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:22,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:29:22,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:29:22,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:29:22,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:29:22,259 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2018-09-26 08:29:22,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:22,564 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2018-09-26 08:29:22,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:29:22,564 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-09-26 08:29:22,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:22,565 INFO L225 Difference]: With dead ends: 215 [2018-09-26 08:29:22,565 INFO L226 Difference]: Without dead ends: 212 [2018-09-26 08:29:22,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:29:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-26 08:29:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-09-26 08:29:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-26 08:29:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2018-09-26 08:29:22,767 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 210 [2018-09-26 08:29:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:22,768 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2018-09-26 08:29:22,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:29:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2018-09-26 08:29:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-26 08:29:22,768 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:22,768 INFO L375 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1, 1] [2018-09-26 08:29:22,769 INFO L423 AbstractCegarLoop]: === Iteration 310 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:22,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:22,769 INFO L82 PathProgramCache]: Analyzing trace with hash -199942495, now seen corresponding path program 307 times [2018-09-26 08:29:22,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:23,446 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:29:23,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:23,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:29:23,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:29:23,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:29:23,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:29:23,447 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 106 states. [2018-09-26 08:29:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:24,994 INFO L93 Difference]: Finished difference Result 320 states and 322 transitions. [2018-09-26 08:29:24,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:29:24,994 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 211 [2018-09-26 08:29:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:24,995 INFO L225 Difference]: With dead ends: 320 [2018-09-26 08:29:24,995 INFO L226 Difference]: Without dead ends: 317 [2018-09-26 08:29:24,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:29:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-09-26 08:29:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 214. [2018-09-26 08:29:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-09-26 08:29:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 216 transitions. [2018-09-26 08:29:25,210 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 216 transitions. Word has length 211 [2018-09-26 08:29:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:25,210 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 216 transitions. [2018-09-26 08:29:25,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:29:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 216 transitions. [2018-09-26 08:29:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:29:25,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:25,212 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1, 1, 1] [2018-09-26 08:29:25,212 INFO L423 AbstractCegarLoop]: === Iteration 311 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:25,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:25,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1903311571, now seen corresponding path program 308 times [2018-09-26 08:29:25,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 5460 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:25,650 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:25,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:29:25,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:29:25,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:29:25,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:29:25,651 INFO L87 Difference]: Start difference. First operand 214 states and 216 transitions. Second operand 107 states. [2018-09-26 08:29:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:26,309 INFO L93 Difference]: Finished difference Result 321 states and 323 transitions. [2018-09-26 08:29:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:29:26,309 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-09-26 08:29:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:26,309 INFO L225 Difference]: With dead ends: 321 [2018-09-26 08:29:26,309 INFO L226 Difference]: Without dead ends: 213 [2018-09-26 08:29:26,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:29:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-26 08:29:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-09-26 08:29:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 08:29:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-09-26 08:29:26,510 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 212 [2018-09-26 08:29:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:26,510 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-09-26 08:29:26,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:29:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-09-26 08:29:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:29:26,511 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:26,511 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1, 1, 1] [2018-09-26 08:29:26,511 INFO L423 AbstractCegarLoop]: === Iteration 312 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:26,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:26,511 INFO L82 PathProgramCache]: Analyzing trace with hash 317273287, now seen corresponding path program 309 times [2018-09-26 08:29:26,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 5460 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:26,988 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:26,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:29:26,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:29:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:29:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:29:26,989 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2018-09-26 08:29:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:27,261 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-09-26 08:29:27,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:29:27,261 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-09-26 08:29:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:27,262 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:29:27,262 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 08:29:27,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:29:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 08:29:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-09-26 08:29:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-09-26 08:29:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2018-09-26 08:29:27,466 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 212 [2018-09-26 08:29:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:27,466 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2018-09-26 08:29:27,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:29:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2018-09-26 08:29:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-26 08:29:27,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:27,467 INFO L375 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1, 1] [2018-09-26 08:29:27,467 INFO L423 AbstractCegarLoop]: === Iteration 313 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:27,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:27,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1245475783, now seen corresponding path program 310 times [2018-09-26 08:29:27,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:28,129 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:29:28,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:28,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:29:28,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:29:28,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:29:28,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:29:28,130 INFO L87 Difference]: Start difference. First operand 214 states and 215 transitions. Second operand 107 states. [2018-09-26 08:29:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:29,719 INFO L93 Difference]: Finished difference Result 323 states and 325 transitions. [2018-09-26 08:29:29,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:29:29,719 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 213 [2018-09-26 08:29:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:29,720 INFO L225 Difference]: With dead ends: 323 [2018-09-26 08:29:29,720 INFO L226 Difference]: Without dead ends: 320 [2018-09-26 08:29:29,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:29:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-09-26 08:29:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 216. [2018-09-26 08:29:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-26 08:29:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 218 transitions. [2018-09-26 08:29:29,959 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 218 transitions. Word has length 213 [2018-09-26 08:29:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:29,959 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 218 transitions. [2018-09-26 08:29:29,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:29:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 218 transitions. [2018-09-26 08:29:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:29:29,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:29,960 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1, 1, 1] [2018-09-26 08:29:29,960 INFO L423 AbstractCegarLoop]: === Iteration 314 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:29,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:29,960 INFO L82 PathProgramCache]: Analyzing trace with hash -45017913, now seen corresponding path program 311 times [2018-09-26 08:29:29,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 5565 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:30,479 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:30,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:29:30,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:29:30,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:29:30,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:29:30,480 INFO L87 Difference]: Start difference. First operand 216 states and 218 transitions. Second operand 108 states. [2018-09-26 08:29:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:31,194 INFO L93 Difference]: Finished difference Result 324 states and 326 transitions. [2018-09-26 08:29:31,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:29:31,194 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-09-26 08:29:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:31,195 INFO L225 Difference]: With dead ends: 324 [2018-09-26 08:29:31,195 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:29:31,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:29:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:29:31,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-09-26 08:29:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:29:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-09-26 08:29:31,400 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 214 [2018-09-26 08:29:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:31,401 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-09-26 08:29:31,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:29:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-09-26 08:29:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:29:31,401 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:31,401 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1, 1, 1] [2018-09-26 08:29:31,401 INFO L423 AbstractCegarLoop]: === Iteration 315 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:31,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:31,402 INFO L82 PathProgramCache]: Analyzing trace with hash 73635949, now seen corresponding path program 312 times [2018-09-26 08:29:31,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 5565 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:31,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:31,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:29:31,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:29:31,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:29:31,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:29:31,859 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 108 states. [2018-09-26 08:29:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:32,143 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-09-26 08:29:32,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:29:32,143 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-09-26 08:29:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:32,143 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:29:32,143 INFO L226 Difference]: Without dead ends: 216 [2018-09-26 08:29:32,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:29:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-09-26 08:29:32,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-09-26 08:29:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-26 08:29:32,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-09-26 08:29:32,358 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 214 [2018-09-26 08:29:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:32,358 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-09-26 08:29:32,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:29:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-09-26 08:29:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-26 08:29:32,359 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:32,359 INFO L375 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1, 1] [2018-09-26 08:29:32,359 INFO L423 AbstractCegarLoop]: === Iteration 316 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:32,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:32,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2012314399, now seen corresponding path program 313 times [2018-09-26 08:29:32,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:33,025 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:29:33,025 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:33,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:29:33,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:29:33,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:29:33,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:29:33,026 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 108 states. [2018-09-26 08:29:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:34,661 INFO L93 Difference]: Finished difference Result 326 states and 328 transitions. [2018-09-26 08:29:34,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:29:34,662 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 215 [2018-09-26 08:29:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:34,662 INFO L225 Difference]: With dead ends: 326 [2018-09-26 08:29:34,662 INFO L226 Difference]: Without dead ends: 323 [2018-09-26 08:29:34,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:29:34,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-09-26 08:29:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 218. [2018-09-26 08:29:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-09-26 08:29:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 220 transitions. [2018-09-26 08:29:34,904 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 220 transitions. Word has length 215 [2018-09-26 08:29:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:34,904 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 220 transitions. [2018-09-26 08:29:34,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:29:34,904 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 220 transitions. [2018-09-26 08:29:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:29:34,905 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:34,905 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1, 1, 1] [2018-09-26 08:29:34,905 INFO L423 AbstractCegarLoop]: === Iteration 317 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:34,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:34,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2042701549, now seen corresponding path program 314 times [2018-09-26 08:29:34,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 5671 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:35,396 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:35,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:29:35,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:29:35,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:29:35,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:29:35,398 INFO L87 Difference]: Start difference. First operand 218 states and 220 transitions. Second operand 109 states. [2018-09-26 08:29:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:36,144 INFO L93 Difference]: Finished difference Result 327 states and 329 transitions. [2018-09-26 08:29:36,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:29:36,145 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-09-26 08:29:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:36,145 INFO L225 Difference]: With dead ends: 327 [2018-09-26 08:29:36,145 INFO L226 Difference]: Without dead ends: 217 [2018-09-26 08:29:36,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:29:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-26 08:29:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-09-26 08:29:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 08:29:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-09-26 08:29:36,381 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 216 [2018-09-26 08:29:36,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:36,382 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-09-26 08:29:36,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:29:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-09-26 08:29:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:29:36,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:36,383 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1, 1, 1] [2018-09-26 08:29:36,383 INFO L423 AbstractCegarLoop]: === Iteration 318 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:36,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:36,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1426003975, now seen corresponding path program 315 times [2018-09-26 08:29:36,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 5671 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:36,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:36,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:29:36,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:29:36,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:29:36,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:29:36,934 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 109 states. [2018-09-26 08:29:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:37,254 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2018-09-26 08:29:37,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:29:37,254 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-09-26 08:29:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:37,254 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:29:37,254 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 08:29:37,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 106 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:29:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 08:29:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-09-26 08:29:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-09-26 08:29:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 219 transitions. [2018-09-26 08:29:37,517 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 219 transitions. Word has length 216 [2018-09-26 08:29:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:37,517 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 219 transitions. [2018-09-26 08:29:37,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:29:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 219 transitions. [2018-09-26 08:29:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-26 08:29:37,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:37,518 INFO L375 BasicCegarLoop]: trace histogram [106, 106, 1, 1, 1, 1, 1] [2018-09-26 08:29:37,518 INFO L423 AbstractCegarLoop]: === Iteration 319 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:37,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:37,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1256388743, now seen corresponding path program 316 times [2018-09-26 08:29:37,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:38,311 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:29:38,312 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:38,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:29:38,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:29:38,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:29:38,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:29:38,312 INFO L87 Difference]: Start difference. First operand 218 states and 219 transitions. Second operand 109 states. [2018-09-26 08:29:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:39,954 INFO L93 Difference]: Finished difference Result 329 states and 331 transitions. [2018-09-26 08:29:39,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:29:39,954 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 217 [2018-09-26 08:29:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:39,955 INFO L225 Difference]: With dead ends: 329 [2018-09-26 08:29:39,955 INFO L226 Difference]: Without dead ends: 326 [2018-09-26 08:29:39,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:29:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-09-26 08:29:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 220. [2018-09-26 08:29:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-09-26 08:29:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-09-26 08:29:40,180 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 217 [2018-09-26 08:29:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:40,180 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-09-26 08:29:40,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:29:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-09-26 08:29:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:29:40,181 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:40,181 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1, 1, 1] [2018-09-26 08:29:40,181 INFO L423 AbstractCegarLoop]: === Iteration 320 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:40,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:40,181 INFO L82 PathProgramCache]: Analyzing trace with hash 293283847, now seen corresponding path program 317 times [2018-09-26 08:29:40,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 5778 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:40,670 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:40,670 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:29:40,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:29:40,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:29:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:29:40,672 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 110 states. [2018-09-26 08:29:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:41,364 INFO L93 Difference]: Finished difference Result 330 states and 332 transitions. [2018-09-26 08:29:41,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:29:41,364 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-09-26 08:29:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:41,364 INFO L225 Difference]: With dead ends: 330 [2018-09-26 08:29:41,364 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:29:41,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:29:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:29:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-09-26 08:29:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:29:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-09-26 08:29:41,579 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 218 [2018-09-26 08:29:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:41,579 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-09-26 08:29:41,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:29:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-09-26 08:29:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:29:41,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:41,580 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1, 1, 1] [2018-09-26 08:29:41,580 INFO L423 AbstractCegarLoop]: === Iteration 321 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:41,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1644471763, now seen corresponding path program 318 times [2018-09-26 08:29:41,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 5778 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:42,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:42,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:29:42,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:29:42,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:29:42,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:29:42,074 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 110 states. [2018-09-26 08:29:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:42,351 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2018-09-26 08:29:42,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:29:42,351 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-09-26 08:29:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:42,351 INFO L225 Difference]: With dead ends: 223 [2018-09-26 08:29:42,351 INFO L226 Difference]: Without dead ends: 220 [2018-09-26 08:29:42,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 107 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:29:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-26 08:29:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-09-26 08:29:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-09-26 08:29:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-09-26 08:29:42,568 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 218 [2018-09-26 08:29:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:42,568 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-09-26 08:29:42,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:29:42,568 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-09-26 08:29:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-26 08:29:42,569 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:42,569 INFO L375 BasicCegarLoop]: trace histogram [107, 107, 1, 1, 1, 1, 1] [2018-09-26 08:29:42,569 INFO L423 AbstractCegarLoop]: === Iteration 322 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:42,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:42,569 INFO L82 PathProgramCache]: Analyzing trace with hash 560921377, now seen corresponding path program 319 times [2018-09-26 08:29:42,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:43,268 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:29:43,268 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:43,268 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:29:43,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:29:43,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:29:43,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:29:43,269 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 110 states. [2018-09-26 08:29:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:44,979 INFO L93 Difference]: Finished difference Result 332 states and 334 transitions. [2018-09-26 08:29:44,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:29:44,979 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 219 [2018-09-26 08:29:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:44,980 INFO L225 Difference]: With dead ends: 332 [2018-09-26 08:29:44,980 INFO L226 Difference]: Without dead ends: 329 [2018-09-26 08:29:44,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:29:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-09-26 08:29:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 222. [2018-09-26 08:29:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-26 08:29:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 224 transitions. [2018-09-26 08:29:45,232 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 224 transitions. Word has length 219 [2018-09-26 08:29:45,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:45,232 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 224 transitions. [2018-09-26 08:29:45,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:29:45,232 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 224 transitions. [2018-09-26 08:29:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:29:45,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:45,233 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1, 1, 1] [2018-09-26 08:29:45,233 INFO L423 AbstractCegarLoop]: === Iteration 323 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:45,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:45,233 INFO L82 PathProgramCache]: Analyzing trace with hash 208631981, now seen corresponding path program 320 times [2018-09-26 08:29:45,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 5886 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:45,800 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:45,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:29:45,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:29:45,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:29:45,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:29:45,802 INFO L87 Difference]: Start difference. First operand 222 states and 224 transitions. Second operand 111 states. [2018-09-26 08:29:46,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:46,458 INFO L93 Difference]: Finished difference Result 333 states and 335 transitions. [2018-09-26 08:29:46,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:29:46,458 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-09-26 08:29:46,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:46,459 INFO L225 Difference]: With dead ends: 333 [2018-09-26 08:29:46,459 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 08:29:46,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:29:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 08:29:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-09-26 08:29:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:29:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-09-26 08:29:46,703 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 220 [2018-09-26 08:29:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:46,703 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-09-26 08:29:46,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:29:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-09-26 08:29:46,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:29:46,704 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:46,704 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1, 1, 1] [2018-09-26 08:29:46,704 INFO L423 AbstractCegarLoop]: === Iteration 324 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:46,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:46,704 INFO L82 PathProgramCache]: Analyzing trace with hash 267750215, now seen corresponding path program 321 times [2018-09-26 08:29:46,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 5886 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:47,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:47,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:29:47,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:29:47,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:29:47,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:29:47,295 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 111 states. [2018-09-26 08:29:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:47,624 INFO L93 Difference]: Finished difference Result 225 states and 226 transitions. [2018-09-26 08:29:47,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:29:47,624 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-09-26 08:29:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:47,625 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:29:47,625 INFO L226 Difference]: Without dead ends: 222 [2018-09-26 08:29:47,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 108 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:29:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-26 08:29:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-09-26 08:29:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-26 08:29:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2018-09-26 08:29:47,871 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 220 [2018-09-26 08:29:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:47,871 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2018-09-26 08:29:47,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:29:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2018-09-26 08:29:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-26 08:29:47,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:47,872 INFO L375 BasicCegarLoop]: trace histogram [108, 108, 1, 1, 1, 1, 1] [2018-09-26 08:29:47,872 INFO L423 AbstractCegarLoop]: === Iteration 325 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:47,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:47,872 INFO L82 PathProgramCache]: Analyzing trace with hash -289739449, now seen corresponding path program 322 times [2018-09-26 08:29:47,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:48,711 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:29:48,712 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:48,712 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:29:48,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:29:48,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:29:48,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:29:48,713 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 111 states. [2018-09-26 08:29:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:50,449 INFO L93 Difference]: Finished difference Result 335 states and 337 transitions. [2018-09-26 08:29:50,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:29:50,449 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 221 [2018-09-26 08:29:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:50,450 INFO L225 Difference]: With dead ends: 335 [2018-09-26 08:29:50,450 INFO L226 Difference]: Without dead ends: 332 [2018-09-26 08:29:50,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:29:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-09-26 08:29:50,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 224. [2018-09-26 08:29:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-09-26 08:29:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 226 transitions. [2018-09-26 08:29:50,706 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 226 transitions. Word has length 221 [2018-09-26 08:29:50,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:50,707 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 226 transitions. [2018-09-26 08:29:50,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:29:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 226 transitions. [2018-09-26 08:29:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:29:50,707 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:50,707 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1, 1, 1] [2018-09-26 08:29:50,708 INFO L423 AbstractCegarLoop]: === Iteration 326 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:50,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:50,708 INFO L82 PathProgramCache]: Analyzing trace with hash -392049849, now seen corresponding path program 323 times [2018-09-26 08:29:50,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 5995 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:51,315 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:51,315 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:29:51,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:29:51,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:29:51,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:29:51,316 INFO L87 Difference]: Start difference. First operand 224 states and 226 transitions. Second operand 112 states. [2018-09-26 08:29:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:52,155 INFO L93 Difference]: Finished difference Result 336 states and 338 transitions. [2018-09-26 08:29:52,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:29:52,155 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-09-26 08:29:52,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:52,155 INFO L225 Difference]: With dead ends: 336 [2018-09-26 08:29:52,155 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:29:52,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:29:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:29:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-09-26 08:29:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:29:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-09-26 08:29:52,405 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 222 [2018-09-26 08:29:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:52,405 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-09-26 08:29:52,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:29:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-09-26 08:29:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:29:52,406 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:52,406 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1, 1, 1] [2018-09-26 08:29:52,406 INFO L423 AbstractCegarLoop]: === Iteration 327 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:52,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:52,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1440615405, now seen corresponding path program 324 times [2018-09-26 08:29:52,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 5995 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:53,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:53,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:29:53,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:29:53,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:29:53,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:29:53,014 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 112 states. [2018-09-26 08:29:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:53,330 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-09-26 08:29:53,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:29:53,330 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-09-26 08:29:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:53,331 INFO L225 Difference]: With dead ends: 227 [2018-09-26 08:29:53,331 INFO L226 Difference]: Without dead ends: 224 [2018-09-26 08:29:53,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 109 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:29:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-26 08:29:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-09-26 08:29:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-09-26 08:29:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 225 transitions. [2018-09-26 08:29:53,582 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 225 transitions. Word has length 222 [2018-09-26 08:29:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:53,583 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 225 transitions. [2018-09-26 08:29:53,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:29:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 225 transitions. [2018-09-26 08:29:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-26 08:29:53,583 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:53,583 INFO L375 BasicCegarLoop]: trace histogram [109, 109, 1, 1, 1, 1, 1] [2018-09-26 08:29:53,583 INFO L423 AbstractCegarLoop]: === Iteration 328 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:53,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:53,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1709343073, now seen corresponding path program 325 times [2018-09-26 08:29:53,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:54,483 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:29:54,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:54,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:29:54,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:29:54,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:29:54,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:29:54,485 INFO L87 Difference]: Start difference. First operand 224 states and 225 transitions. Second operand 112 states. [2018-09-26 08:29:56,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:56,120 INFO L93 Difference]: Finished difference Result 338 states and 340 transitions. [2018-09-26 08:29:56,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:29:56,120 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 223 [2018-09-26 08:29:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:56,121 INFO L225 Difference]: With dead ends: 338 [2018-09-26 08:29:56,121 INFO L226 Difference]: Without dead ends: 335 [2018-09-26 08:29:56,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:29:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-09-26 08:29:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 226. [2018-09-26 08:29:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-26 08:29:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 228 transitions. [2018-09-26 08:29:56,352 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 228 transitions. Word has length 223 [2018-09-26 08:29:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:56,352 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 228 transitions. [2018-09-26 08:29:56,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:29:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 228 transitions. [2018-09-26 08:29:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:29:56,353 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:56,353 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1, 1, 1] [2018-09-26 08:29:56,353 INFO L423 AbstractCegarLoop]: === Iteration 329 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:56,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:56,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1449966189, now seen corresponding path program 326 times [2018-09-26 08:29:56,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 6105 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:56,866 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:56,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:29:56,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:29:56,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:29:56,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:29:56,867 INFO L87 Difference]: Start difference. First operand 226 states and 228 transitions. Second operand 113 states. [2018-09-26 08:29:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:57,443 INFO L93 Difference]: Finished difference Result 339 states and 341 transitions. [2018-09-26 08:29:57,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:29:57,443 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-09-26 08:29:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:57,444 INFO L225 Difference]: With dead ends: 339 [2018-09-26 08:29:57,444 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:29:57,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:29:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:29:57,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-26 08:29:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:29:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-09-26 08:29:57,679 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 224 [2018-09-26 08:29:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:57,679 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-09-26 08:29:57,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:29:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-09-26 08:29:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:29:57,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:57,680 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1, 1, 1] [2018-09-26 08:29:57,680 INFO L423 AbstractCegarLoop]: === Iteration 330 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:57,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:57,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1866953081, now seen corresponding path program 327 times [2018-09-26 08:29:57,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 6105 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:58,238 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:58,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:29:58,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:29:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:29:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:29:58,239 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 113 states. [2018-09-26 08:29:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:58,576 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-09-26 08:29:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:29:58,576 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-09-26 08:29:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:58,576 INFO L225 Difference]: With dead ends: 229 [2018-09-26 08:29:58,576 INFO L226 Difference]: Without dead ends: 226 [2018-09-26 08:29:58,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:29:58,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-26 08:29:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-09-26 08:29:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-26 08:29:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2018-09-26 08:29:58,801 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 224 [2018-09-26 08:29:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:58,801 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2018-09-26 08:29:58,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:29:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2018-09-26 08:29:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-26 08:29:58,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:58,802 INFO L375 BasicCegarLoop]: trace histogram [110, 110, 1, 1, 1, 1, 1] [2018-09-26 08:29:58,802 INFO L423 AbstractCegarLoop]: === Iteration 331 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:58,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:58,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2041032185, now seen corresponding path program 328 times [2018-09-26 08:29:58,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:59,577 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:29:59,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:59,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:29:59,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:29:59,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:29:59,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:29:59,578 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 113 states. [2018-09-26 08:30:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:01,314 INFO L93 Difference]: Finished difference Result 341 states and 343 transitions. [2018-09-26 08:30:01,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:30:01,314 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 225 [2018-09-26 08:30:01,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:01,314 INFO L225 Difference]: With dead ends: 341 [2018-09-26 08:30:01,314 INFO L226 Difference]: Without dead ends: 338 [2018-09-26 08:30:01,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:30:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-09-26 08:30:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 228. [2018-09-26 08:30:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-26 08:30:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 230 transitions. [2018-09-26 08:30:01,558 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 230 transitions. Word has length 225 [2018-09-26 08:30:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:01,558 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 230 transitions. [2018-09-26 08:30:01,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:30:01,558 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 230 transitions. [2018-09-26 08:30:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:30:01,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:01,559 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1, 1, 1] [2018-09-26 08:30:01,559 INFO L423 AbstractCegarLoop]: === Iteration 332 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:01,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1152450183, now seen corresponding path program 329 times [2018-09-26 08:30:01,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 6216 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:02,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:02,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:30:02,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:30:02,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:30:02,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:30:02,046 INFO L87 Difference]: Start difference. First operand 228 states and 230 transitions. Second operand 114 states. [2018-09-26 08:30:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:02,655 INFO L93 Difference]: Finished difference Result 342 states and 344 transitions. [2018-09-26 08:30:02,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:30:02,655 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-09-26 08:30:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:02,655 INFO L225 Difference]: With dead ends: 342 [2018-09-26 08:30:02,655 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:30:02,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:30:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:30:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-26 08:30:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:30:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-09-26 08:30:02,883 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 226 [2018-09-26 08:30:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:02,884 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-09-26 08:30:02,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:30:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-09-26 08:30:02,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:30:02,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:02,884 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1, 1, 1] [2018-09-26 08:30:02,884 INFO L423 AbstractCegarLoop]: === Iteration 333 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:02,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:02,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1407167917, now seen corresponding path program 330 times [2018-09-26 08:30:02,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 6216 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:03,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:03,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:30:03,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:30:03,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:30:03,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:30:03,437 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 114 states. [2018-09-26 08:30:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:03,729 INFO L93 Difference]: Finished difference Result 231 states and 232 transitions. [2018-09-26 08:30:03,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:30:03,729 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-09-26 08:30:03,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:03,730 INFO L225 Difference]: With dead ends: 231 [2018-09-26 08:30:03,730 INFO L226 Difference]: Without dead ends: 228 [2018-09-26 08:30:03,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 111 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:30:03,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-26 08:30:03,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-09-26 08:30:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-26 08:30:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 229 transitions. [2018-09-26 08:30:03,959 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 229 transitions. Word has length 226 [2018-09-26 08:30:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:03,959 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 229 transitions. [2018-09-26 08:30:03,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:30:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 229 transitions. [2018-09-26 08:30:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-26 08:30:03,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:03,960 INFO L375 BasicCegarLoop]: trace histogram [111, 111, 1, 1, 1, 1, 1] [2018-09-26 08:30:03,960 INFO L423 AbstractCegarLoop]: === Iteration 334 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:03,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:03,960 INFO L82 PathProgramCache]: Analyzing trace with hash 672470945, now seen corresponding path program 331 times [2018-09-26 08:30:03,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:04,778 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:30:04,778 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:04,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:30:04,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:30:04,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:30:04,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:30:04,779 INFO L87 Difference]: Start difference. First operand 228 states and 229 transitions. Second operand 114 states. [2018-09-26 08:30:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:06,401 INFO L93 Difference]: Finished difference Result 344 states and 346 transitions. [2018-09-26 08:30:06,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:30:06,402 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 227 [2018-09-26 08:30:06,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:06,402 INFO L225 Difference]: With dead ends: 344 [2018-09-26 08:30:06,402 INFO L226 Difference]: Without dead ends: 341 [2018-09-26 08:30:06,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:30:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-09-26 08:30:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 230. [2018-09-26 08:30:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-09-26 08:30:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 232 transitions. [2018-09-26 08:30:06,640 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 232 transitions. Word has length 227 [2018-09-26 08:30:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:06,640 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 232 transitions. [2018-09-26 08:30:06,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:30:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 232 transitions. [2018-09-26 08:30:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:30:06,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:06,641 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1, 1, 1] [2018-09-26 08:30:06,641 INFO L423 AbstractCegarLoop]: === Iteration 335 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:06,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:06,641 INFO L82 PathProgramCache]: Analyzing trace with hash -628298707, now seen corresponding path program 332 times [2018-09-26 08:30:06,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 6328 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:07,185 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:07,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:30:07,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:30:07,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:30:07,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:30:07,187 INFO L87 Difference]: Start difference. First operand 230 states and 232 transitions. Second operand 115 states. [2018-09-26 08:30:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:07,851 INFO L93 Difference]: Finished difference Result 345 states and 347 transitions. [2018-09-26 08:30:07,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:30:07,852 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-09-26 08:30:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:07,852 INFO L225 Difference]: With dead ends: 345 [2018-09-26 08:30:07,852 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:30:07,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:30:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:30:08,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-09-26 08:30:08,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 08:30:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-09-26 08:30:08,086 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 228 [2018-09-26 08:30:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:08,086 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-09-26 08:30:08,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:30:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-09-26 08:30:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:30:08,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:08,087 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1, 1, 1] [2018-09-26 08:30:08,087 INFO L423 AbstractCegarLoop]: === Iteration 336 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:08,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:08,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1321983545, now seen corresponding path program 333 times [2018-09-26 08:30:08,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 6328 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:08,679 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:08,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:30:08,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:30:08,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:30:08,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:30:08,680 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 115 states. [2018-09-26 08:30:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:08,975 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2018-09-26 08:30:08,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:30:08,975 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-09-26 08:30:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:08,975 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:30:08,975 INFO L226 Difference]: Without dead ends: 230 [2018-09-26 08:30:08,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 112 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:30:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-26 08:30:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-09-26 08:30:09,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-09-26 08:30:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-09-26 08:30:09,209 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 228 [2018-09-26 08:30:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:09,209 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-09-26 08:30:09,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:30:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-09-26 08:30:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-26 08:30:09,210 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:09,210 INFO L375 BasicCegarLoop]: trace histogram [112, 112, 1, 1, 1, 1, 1] [2018-09-26 08:30:09,210 INFO L423 AbstractCegarLoop]: === Iteration 337 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:09,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:09,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1968121543, now seen corresponding path program 334 times [2018-09-26 08:30:09,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:10,021 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:30:10,021 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:10,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:30:10,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:30:10,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:30:10,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:30:10,022 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 115 states. [2018-09-26 08:30:11,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:11,827 INFO L93 Difference]: Finished difference Result 347 states and 349 transitions. [2018-09-26 08:30:11,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:30:11,827 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 229 [2018-09-26 08:30:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:11,828 INFO L225 Difference]: With dead ends: 347 [2018-09-26 08:30:11,828 INFO L226 Difference]: Without dead ends: 344 [2018-09-26 08:30:11,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:30:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-09-26 08:30:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 232. [2018-09-26 08:30:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-26 08:30:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 234 transitions. [2018-09-26 08:30:12,103 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 234 transitions. Word has length 229 [2018-09-26 08:30:12,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:12,103 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 234 transitions. [2018-09-26 08:30:12,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:30:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 234 transitions. [2018-09-26 08:30:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:30:12,104 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:12,104 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1, 1, 1] [2018-09-26 08:30:12,104 INFO L423 AbstractCegarLoop]: === Iteration 338 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:12,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:12,104 INFO L82 PathProgramCache]: Analyzing trace with hash 882164167, now seen corresponding path program 335 times [2018-09-26 08:30:12,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 6441 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:12,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:12,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:30:12,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:30:12,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:30:12,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:30:12,703 INFO L87 Difference]: Start difference. First operand 232 states and 234 transitions. Second operand 116 states. [2018-09-26 08:30:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:13,490 INFO L93 Difference]: Finished difference Result 348 states and 350 transitions. [2018-09-26 08:30:13,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:30:13,490 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-09-26 08:30:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:13,491 INFO L225 Difference]: With dead ends: 348 [2018-09-26 08:30:13,491 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:30:13,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:30:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:30:13,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-09-26 08:30:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:30:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-09-26 08:30:13,759 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 230 [2018-09-26 08:30:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:13,759 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-09-26 08:30:13,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:30:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-09-26 08:30:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:30:13,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:13,760 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1, 1, 1] [2018-09-26 08:30:13,760 INFO L423 AbstractCegarLoop]: === Iteration 339 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:13,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash 852770669, now seen corresponding path program 336 times [2018-09-26 08:30:13,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 6441 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:14,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:14,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:30:14,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:30:14,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:30:14,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:30:14,436 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 116 states. [2018-09-26 08:30:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:14,781 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2018-09-26 08:30:14,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:30:14,781 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-09-26 08:30:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:14,782 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:30:14,782 INFO L226 Difference]: Without dead ends: 232 [2018-09-26 08:30:14,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:30:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-09-26 08:30:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-09-26 08:30:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-26 08:30:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 233 transitions. [2018-09-26 08:30:15,051 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 233 transitions. Word has length 230 [2018-09-26 08:30:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:15,051 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 233 transitions. [2018-09-26 08:30:15,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:30:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 233 transitions. [2018-09-26 08:30:15,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-26 08:30:15,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:15,052 INFO L375 BasicCegarLoop]: trace histogram [113, 113, 1, 1, 1, 1, 1] [2018-09-26 08:30:15,052 INFO L423 AbstractCegarLoop]: === Iteration 340 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:15,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:15,053 INFO L82 PathProgramCache]: Analyzing trace with hash 666025441, now seen corresponding path program 337 times [2018-09-26 08:30:15,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:16,030 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:30:16,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:16,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:30:16,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:30:16,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:30:16,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:30:16,031 INFO L87 Difference]: Start difference. First operand 232 states and 233 transitions. Second operand 116 states. [2018-09-26 08:30:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:17,714 INFO L93 Difference]: Finished difference Result 350 states and 352 transitions. [2018-09-26 08:30:17,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:30:17,714 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 231 [2018-09-26 08:30:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:17,714 INFO L225 Difference]: With dead ends: 350 [2018-09-26 08:30:17,715 INFO L226 Difference]: Without dead ends: 347 [2018-09-26 08:30:17,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:30:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-09-26 08:30:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 234. [2018-09-26 08:30:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-26 08:30:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2018-09-26 08:30:17,971 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 231 [2018-09-26 08:30:17,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:17,971 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2018-09-26 08:30:17,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:30:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2018-09-26 08:30:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:30:17,971 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:17,972 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1, 1, 1] [2018-09-26 08:30:17,972 INFO L423 AbstractCegarLoop]: === Iteration 341 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:17,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash -828109331, now seen corresponding path program 338 times [2018-09-26 08:30:17,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 6555 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:18,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:18,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:30:18,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:30:18,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:30:18,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:30:18,533 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 117 states. [2018-09-26 08:30:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:19,232 INFO L93 Difference]: Finished difference Result 351 states and 353 transitions. [2018-09-26 08:30:19,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:30:19,232 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-09-26 08:30:19,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:19,232 INFO L225 Difference]: With dead ends: 351 [2018-09-26 08:30:19,232 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:30:19,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:30:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:30:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-09-26 08:30:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:30:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-09-26 08:30:19,473 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 232 [2018-09-26 08:30:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:19,474 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-09-26 08:30:19,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:30:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-09-26 08:30:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:30:19,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:19,474 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1, 1, 1] [2018-09-26 08:30:19,474 INFO L423 AbstractCegarLoop]: === Iteration 342 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:19,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:19,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1739307769, now seen corresponding path program 339 times [2018-09-26 08:30:19,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 6555 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:20,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:20,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:30:20,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:30:20,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:30:20,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:30:20,042 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 117 states. [2018-09-26 08:30:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:20,420 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-09-26 08:30:20,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:30:20,420 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-09-26 08:30:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:20,421 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:30:20,421 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 08:30:20,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 114 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:30:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 08:30:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-09-26 08:30:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-26 08:30:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2018-09-26 08:30:20,703 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 232 [2018-09-26 08:30:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:20,703 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2018-09-26 08:30:20,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:30:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2018-09-26 08:30:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-26 08:30:20,704 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:20,704 INFO L375 BasicCegarLoop]: trace histogram [114, 114, 1, 1, 1, 1, 1] [2018-09-26 08:30:20,704 INFO L423 AbstractCegarLoop]: === Iteration 343 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:20,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:20,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1915972487, now seen corresponding path program 340 times [2018-09-26 08:30:20,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:21,673 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:30:21,674 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:21,674 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:30:21,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:30:21,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:30:21,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:30:21,675 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 117 states. [2018-09-26 08:30:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:23,610 INFO L93 Difference]: Finished difference Result 353 states and 355 transitions. [2018-09-26 08:30:23,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:30:23,610 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 233 [2018-09-26 08:30:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:23,610 INFO L225 Difference]: With dead ends: 353 [2018-09-26 08:30:23,610 INFO L226 Difference]: Without dead ends: 350 [2018-09-26 08:30:23,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:30:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-09-26 08:30:23,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 236. [2018-09-26 08:30:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-26 08:30:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 238 transitions. [2018-09-26 08:30:23,897 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 238 transitions. Word has length 233 [2018-09-26 08:30:23,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:23,897 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 238 transitions. [2018-09-26 08:30:23,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:30:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 238 transitions. [2018-09-26 08:30:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:30:23,898 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:23,898 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1, 1, 1] [2018-09-26 08:30:23,898 INFO L423 AbstractCegarLoop]: === Iteration 344 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:23,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:23,898 INFO L82 PathProgramCache]: Analyzing trace with hash -734456569, now seen corresponding path program 341 times [2018-09-26 08:30:23,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 6670 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:24,581 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:24,581 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:30:24,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:30:24,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:30:24,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:30:24,583 INFO L87 Difference]: Start difference. First operand 236 states and 238 transitions. Second operand 118 states. [2018-09-26 08:30:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:25,261 INFO L93 Difference]: Finished difference Result 354 states and 356 transitions. [2018-09-26 08:30:25,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:30:25,261 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-09-26 08:30:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:25,261 INFO L225 Difference]: With dead ends: 354 [2018-09-26 08:30:25,262 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:30:25,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:30:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:30:25,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 08:30:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:30:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-09-26 08:30:25,542 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 234 [2018-09-26 08:30:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:25,543 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-09-26 08:30:25,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:30:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-09-26 08:30:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:30:25,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:25,544 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1, 1, 1] [2018-09-26 08:30:25,544 INFO L423 AbstractCegarLoop]: === Iteration 345 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:25,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:25,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1083162925, now seen corresponding path program 342 times [2018-09-26 08:30:25,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 6670 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:26,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:26,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:30:26,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:30:26,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:30:26,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:30:26,261 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 118 states. [2018-09-26 08:30:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:26,684 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2018-09-26 08:30:26,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:30:26,684 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-09-26 08:30:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:26,685 INFO L225 Difference]: With dead ends: 239 [2018-09-26 08:30:26,685 INFO L226 Difference]: Without dead ends: 236 [2018-09-26 08:30:26,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:30:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-09-26 08:30:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-09-26 08:30:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-26 08:30:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 237 transitions. [2018-09-26 08:30:26,935 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 237 transitions. Word has length 234 [2018-09-26 08:30:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:26,935 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 237 transitions. [2018-09-26 08:30:26,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:30:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 237 transitions. [2018-09-26 08:30:26,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-26 08:30:26,936 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:26,936 INFO L375 BasicCegarLoop]: trace histogram [115, 115, 1, 1, 1, 1, 1] [2018-09-26 08:30:26,936 INFO L423 AbstractCegarLoop]: === Iteration 346 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:26,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:26,936 INFO L82 PathProgramCache]: Analyzing trace with hash -781749215, now seen corresponding path program 343 times [2018-09-26 08:30:26,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:27,906 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:30:27,907 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:27,907 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:30:27,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:30:27,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:30:27,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:30:27,908 INFO L87 Difference]: Start difference. First operand 236 states and 237 transitions. Second operand 118 states. [2018-09-26 08:30:29,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:29,856 INFO L93 Difference]: Finished difference Result 356 states and 358 transitions. [2018-09-26 08:30:29,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:30:29,856 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 235 [2018-09-26 08:30:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:29,857 INFO L225 Difference]: With dead ends: 356 [2018-09-26 08:30:29,857 INFO L226 Difference]: Without dead ends: 353 [2018-09-26 08:30:29,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:30:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-09-26 08:30:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 238. [2018-09-26 08:30:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-26 08:30:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 240 transitions. [2018-09-26 08:30:30,153 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 240 transitions. Word has length 235 [2018-09-26 08:30:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:30,154 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 240 transitions. [2018-09-26 08:30:30,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:30:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 240 transitions. [2018-09-26 08:30:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 08:30:30,154 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:30,154 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1, 1, 1] [2018-09-26 08:30:30,154 INFO L423 AbstractCegarLoop]: === Iteration 347 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:30,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:30,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1535516589, now seen corresponding path program 344 times [2018-09-26 08:30:30,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 6786 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:30,779 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:30,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:30:30,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:30:30,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:30:30,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:30:30,780 INFO L87 Difference]: Start difference. First operand 238 states and 240 transitions. Second operand 119 states. [2018-09-26 08:30:31,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:31,502 INFO L93 Difference]: Finished difference Result 357 states and 359 transitions. [2018-09-26 08:30:31,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:30:31,502 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-09-26 08:30:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:31,502 INFO L225 Difference]: With dead ends: 357 [2018-09-26 08:30:31,502 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 08:30:31,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:30:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 08:30:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-26 08:30:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 08:30:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-09-26 08:30:31,755 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 236 [2018-09-26 08:30:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:31,755 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-09-26 08:30:31,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:30:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-09-26 08:30:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 08:30:31,755 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:31,756 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1, 1, 1] [2018-09-26 08:30:31,756 INFO L423 AbstractCegarLoop]: === Iteration 348 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:31,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:31,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2047146055, now seen corresponding path program 345 times [2018-09-26 08:30:31,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 6786 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:32,377 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:32,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:30:32,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:30:32,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:30:32,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:30:32,378 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 119 states. [2018-09-26 08:30:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:32,715 INFO L93 Difference]: Finished difference Result 241 states and 242 transitions. [2018-09-26 08:30:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:30:32,715 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-09-26 08:30:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:32,716 INFO L225 Difference]: With dead ends: 241 [2018-09-26 08:30:32,716 INFO L226 Difference]: Without dead ends: 238 [2018-09-26 08:30:32,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 116 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:30:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-26 08:30:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-09-26 08:30:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-26 08:30:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2018-09-26 08:30:32,993 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 236 [2018-09-26 08:30:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:32,993 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2018-09-26 08:30:32,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:30:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2018-09-26 08:30:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-09-26 08:30:32,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:32,994 INFO L375 BasicCegarLoop]: trace histogram [116, 116, 1, 1, 1, 1, 1] [2018-09-26 08:30:32,994 INFO L423 AbstractCegarLoop]: === Iteration 349 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:32,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:32,994 INFO L82 PathProgramCache]: Analyzing trace with hash -963043257, now seen corresponding path program 346 times [2018-09-26 08:30:32,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:34,048 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:30:34,049 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:34,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:30:34,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:30:34,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:30:34,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:30:34,050 INFO L87 Difference]: Start difference. First operand 238 states and 239 transitions. Second operand 119 states. [2018-09-26 08:30:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:36,018 INFO L93 Difference]: Finished difference Result 359 states and 361 transitions. [2018-09-26 08:30:36,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:30:36,019 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 237 [2018-09-26 08:30:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:36,019 INFO L225 Difference]: With dead ends: 359 [2018-09-26 08:30:36,019 INFO L226 Difference]: Without dead ends: 356 [2018-09-26 08:30:36,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:30:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-09-26 08:30:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 240. [2018-09-26 08:30:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-09-26 08:30:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 242 transitions. [2018-09-26 08:30:36,337 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 242 transitions. Word has length 237 [2018-09-26 08:30:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:36,338 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 242 transitions. [2018-09-26 08:30:36,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:30:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 242 transitions. [2018-09-26 08:30:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:30:36,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:36,339 INFO L375 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1, 1, 1] [2018-09-26 08:30:36,339 INFO L423 AbstractCegarLoop]: === Iteration 350 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:36,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:36,339 INFO L82 PathProgramCache]: Analyzing trace with hash 210368583, now seen corresponding path program 347 times [2018-09-26 08:30:36,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:30:36,722 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:262) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:204) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-09-26 08:30:36,725 INFO L168 Benchmark]: Toolchain (without parser) took 257260.92 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -708.7 MB). Peak memory consumption was 717.8 MB. Max. memory is 7.1 GB. [2018-09-26 08:30:36,727 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:30:36,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.22 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:30:36,727 INFO L168 Benchmark]: Boogie Preprocessor took 24.51 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:30:36,727 INFO L168 Benchmark]: RCFGBuilder took 241.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:30:36,728 INFO L168 Benchmark]: TraceAbstraction took 256945.85 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -719.3 MB). Peak memory consumption was 707.3 MB. Max. memory is 7.1 GB. [2018-09-26 08:30:36,730 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.22 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 24.51 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 241.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256945.85 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -719.3 MB). Peak memory consumption was 707.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/doubleLoopUniformIterations.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-30-36-740.csv Completed graceful shutdown