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/HiddenEqualityWithBranches.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:21:37,270 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:21:37,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:21:37,285 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:21:37,285 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:21:37,286 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:21:37,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:21:37,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:21:37,292 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:21:37,293 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:21:37,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:21:37,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:21:37,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:21:37,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:21:37,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:21:37,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:21:37,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:21:37,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:21:37,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:21:37,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:21:37,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:21:37,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:21:37,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:21:37,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:21:37,311 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:21:37,312 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:21:37,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:21:37,314 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:21:37,315 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:21:37,316 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:21:37,316 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:21:37,317 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:21:37,317 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:21:37,317 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:21:37,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:21:37,319 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:21:37,320 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:21:37,328 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:21:37,328 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:21:37,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:21:37,330 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:21:37,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:21:37,330 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:21:37,330 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:21:37,331 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:21:37,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:21:37,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:21:37,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:21:37,391 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:21:37,392 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:21:37,392 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEqualityWithBranches.bpl [2018-09-26 08:21:37,393 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEqualityWithBranches.bpl' [2018-09-26 08:21:37,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:21:37,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:21:37,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:21:37,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:21:37,445 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:21:37,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:37" (1/1) ... [2018-09-26 08:21:37,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:37" (1/1) ... [2018-09-26 08:21:37,485 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:21:37,485 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:21:37,485 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:21:37,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:21:37,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:21:37,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:21:37,489 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:21:37,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:37" (1/1) ... [2018-09-26 08:21:37,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:37" (1/1) ... [2018-09-26 08:21:37,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:37" (1/1) ... [2018-09-26 08:21:37,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:37" (1/1) ... [2018-09-26 08:21:37,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:37" (1/1) ... [2018-09-26 08:21:37,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:37" (1/1) ... [2018-09-26 08:21:37,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:37" (1/1) ... [2018-09-26 08:21:37,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:21:37,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:21:37,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:21:37,512 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:21:37,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:37" (1/1) ... [2018-09-26 08:21:37,606 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 08:21:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:21:37,607 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:21:37,794 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:21:37,795 INFO L202 PluginConnector]: Adding new model HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:21:37 BoogieIcfgContainer [2018-09-26 08:21:37,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:21:37,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:21:37,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:21:37,801 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:21:37,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:37" (1/2) ... [2018-09-26 08:21:37,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e05c71c and model type HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:21:37, skipping insertion in model container [2018-09-26 08:21:37,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:21:37" (2/2) ... [2018-09-26 08:21:37,805 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenEqualityWithBranches.bpl [2018-09-26 08:21:37,816 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:21:37,826 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:21:37,885 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:21:37,886 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:21:37,886 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:21:37,886 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:21:37,887 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:21:37,887 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:21:37,887 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:21:37,888 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:21:37,889 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:21:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2018-09-26 08:21:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-09-26 08:21:37,919 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:37,920 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-09-26 08:21:37,921 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:37,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:37,930 INFO L82 PathProgramCache]: Analyzing trace with hash 979, now seen corresponding path program 1 times [2018-09-26 08:21:37,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,000 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:21:38,003 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:21:38,003 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 08:21:38,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:21:38,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:21:38,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:21:38,025 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2018-09-26 08:21:38,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,057 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-09-26 08:21:38,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:21:38,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-09-26 08:21:38,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,072 INFO L225 Difference]: With dead ends: 7 [2018-09-26 08:21:38,072 INFO L226 Difference]: Without dead ends: 4 [2018-09-26 08:21:38,079 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:21:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-09-26 08:21:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-09-26 08:21:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-09-26 08:21:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-09-26 08:21:38,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-09-26 08:21:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,131 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-09-26 08:21:38,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:21:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-09-26 08:21:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:21:38,132 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,132 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:21:38,132 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,134 INFO L82 PathProgramCache]: Analyzing trace with hash 30584, now seen corresponding path program 1 times [2018-09-26 08:21:38,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,162 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,162 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-09-26 08:21:38,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:21:38,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:21:38,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:21:38,166 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-09-26 08:21:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,183 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-09-26 08:21:38,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:21:38,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-09-26 08:21:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,185 INFO L225 Difference]: With dead ends: 6 [2018-09-26 08:21:38,185 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:21:38,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:21:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:21:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:21:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:21:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:21:38,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:21:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,189 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:21:38,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:21:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:21:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:21:38,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,190 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-09-26 08:21:38,190 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,191 INFO L82 PathProgramCache]: Analyzing trace with hash 948339, now seen corresponding path program 2 times [2018-09-26 08:21:38,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,246 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:21:38,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:21:38,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:21:38,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:21:38,247 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-09-26 08:21:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,262 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-09-26 08:21:38,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:21:38,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:21:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,263 INFO L225 Difference]: With dead ends: 7 [2018-09-26 08:21:38,263 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:21:38,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:21:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:21:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:21:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:21:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:21:38,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:21:38,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,268 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:21:38,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:21:38,268 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:21:38,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:21:38,269 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,269 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-09-26 08:21:38,269 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,270 INFO L82 PathProgramCache]: Analyzing trace with hash 29398744, now seen corresponding path program 3 times [2018-09-26 08:21:38,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,327 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:21:38,328 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:21:38,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:21:38,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:21:38,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:21:38,332 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-09-26 08:21:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,362 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:21:38,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:21:38,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 08:21:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,363 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:21:38,364 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:21:38,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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:21:38,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:21:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:21:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:21:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:21:38,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:21:38,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,368 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:21:38,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:21:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:21:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:21:38,369 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,369 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-09-26 08:21:38,370 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash 911361299, now seen corresponding path program 4 times [2018-09-26 08:21:38,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:21:38,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:21:38,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:21:38,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:21:38,451 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-09-26 08:21:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,488 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:21:38,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:21:38,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:21:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,489 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:21:38,489 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:21:38,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:21:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:21:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:21:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:21:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:21:38,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:21:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,497 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:21:38,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:21:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:21:38,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:21:38,497 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,498 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-09-26 08:21:38,498 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1812570568, now seen corresponding path program 5 times [2018-09-26 08:21:38,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:21:38,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:21:38,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:21:38,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:21:38,565 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-09-26 08:21:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,591 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:21:38,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:21:38,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:21:38,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,592 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:21:38,592 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:21:38,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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:21:38,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:21:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:21:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:21:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:21:38,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:21:38,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,602 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:21:38,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:21:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:21:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:21:38,603 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,603 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-09-26 08:21:38,603 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash -355112525, now seen corresponding path program 6 times [2018-09-26 08:21:38,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:21:38,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:21:38,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:21:38,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:21:38,689 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-09-26 08:21:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,705 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:21:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:21:38,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-09-26 08:21:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,706 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:21:38,706 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:21:38,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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:21:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:21:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:21:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:21:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:21:38,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:21:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,711 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:21:38,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:21:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:21:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:21:38,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,712 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-09-26 08:21:38,712 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1876413848, now seen corresponding path program 7 times [2018-09-26 08:21:38,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,824 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:21:38,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:21:38,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:21:38,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:21:38,826 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-09-26 08:21:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,848 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:21:38,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:21:38,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-09-26 08:21:38,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,855 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:21:38,855 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:21:38,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 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:21:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:21:38,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:21:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:21:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:21:38,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:21:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,869 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:21:38,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:21:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:21:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:21:38,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,870 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-09-26 08:21:38,870 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1960712621, now seen corresponding path program 8 times [2018-09-26 08:21:38,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:21:38,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:21:38,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:21:38,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:21:38,975 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-09-26 08:21:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,991 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:21:38,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:21:38,992 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-09-26 08:21:38,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,993 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:21:38,993 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:21:38,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 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:21:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:21:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:21:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:21:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:21:38,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:21:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,998 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:21:38,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:21:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:21:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:21:39,003 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,003 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-09-26 08:21:39,003 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,004 INFO L82 PathProgramCache]: Analyzing trace with hash -652548872, now seen corresponding path program 9 times [2018-09-26 08:21:39,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,104 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,105 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:21:39,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:21:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:21:39,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:21:39,107 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-09-26 08:21:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,143 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:21:39,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:21:39,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-26 08:21:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,144 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:21:39,145 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:21:39,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 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:21:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:21:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:21:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:21:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:21:39,152 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:21:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,152 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:21:39,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:21:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:21:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:21:39,156 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,156 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-09-26 08:21:39,156 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1245821683, now seen corresponding path program 10 times [2018-09-26 08:21:39,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,241 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:21:39,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:21:39,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:21:39,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:21:39,246 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-09-26 08:21:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,281 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:21:39,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:21:39,282 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-26 08:21:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,283 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:21:39,285 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:21:39,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 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:21:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:21:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:21:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:21:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:21:39,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:21:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,298 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:21:39,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:21:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:21:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:21:39,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,302 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-09-26 08:21:39,303 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,304 INFO L82 PathProgramCache]: Analyzing trace with hash -34233256, now seen corresponding path program 11 times [2018-09-26 08:21:39,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,413 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,413 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:21:39,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:21:39,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:21:39,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:21:39,416 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-09-26 08:21:39,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,435 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:21:39,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:21:39,436 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 08:21:39,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,437 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:21:39,437 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:21:39,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 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:21:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:21:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:21:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:21:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:21:39,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:21:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,445 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:21:39,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:21:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:21:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:21:39,446 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,446 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-09-26 08:21:39,448 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1061230701, now seen corresponding path program 12 times [2018-09-26 08:21:39,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:21:39,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:21:39,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:21:39,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:21:39,525 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-09-26 08:21:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,541 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:21:39,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:21:39,541 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-09-26 08:21:39,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,542 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:21:39,542 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:21:39,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 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:21:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:21:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:21:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:21:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:21:39,548 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 08:21:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,548 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:21:39,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:21:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:21:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:21:39,549 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,549 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-09-26 08:21:39,550 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1461586872, now seen corresponding path program 13 times [2018-09-26 08:21:39,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:21:39,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:21:39,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:21:39,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:21:39,636 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-09-26 08:21:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,667 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:21:39,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:21:39,667 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-26 08:21:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,668 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:21:39,668 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:21:39,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 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:21:39,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:21:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:21:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:21:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:21:39,675 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-26 08:21:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,675 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:21:39,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:21:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:21:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:21:39,679 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,680 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-09-26 08:21:39,680 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1935446989, now seen corresponding path program 14 times [2018-09-26 08:21:39,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,788 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:21:39,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:21:39,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:21:39,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:21:39,790 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-09-26 08:21:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,808 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:21:39,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:21:39,809 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 08:21:39,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,809 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:21:39,810 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:21:39,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 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:21:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:21:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:21:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:21:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:21:39,818 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-26 08:21:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,819 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:21:39,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:21:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:21:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:21:39,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,820 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-09-26 08:21:39,820 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,821 INFO L82 PathProgramCache]: Analyzing trace with hash 130685720, now seen corresponding path program 15 times [2018-09-26 08:21:39,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,904 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,904 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:21:39,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:21:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:21:39,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:21:39,910 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-09-26 08:21:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,928 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:21:39,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:21:39,929 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-09-26 08:21:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,930 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:21:39,930 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:21:39,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 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:21:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:21:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:21:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:21:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:21:39,946 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-26 08:21:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,951 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:21:39,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:21:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:21:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:21:39,952 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,952 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-09-26 08:21:39,953 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash -243709741, now seen corresponding path program 16 times [2018-09-26 08:21:39,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:40,051 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:40,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:21:40,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:21:40,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:21:40,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:21:40,053 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-09-26 08:21:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:40,070 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:21:40,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:21:40,071 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-09-26 08:21:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:40,072 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:21:40,072 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:21:40,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 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:21:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:21:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:21:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:21:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:21:40,085 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-26 08:21:40,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:40,092 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:21:40,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:21:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:21:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:21:40,094 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:40,094 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-09-26 08:21:40,095 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:40,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1034932856, now seen corresponding path program 17 times [2018-09-26 08:21:40,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:40,191 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:40,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:21:40,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:21:40,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:21:40,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:21:40,193 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-09-26 08:21:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:40,214 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:21:40,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:21:40,214 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-09-26 08:21:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:40,215 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:21:40,215 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:21:40,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 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:21:40,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:21:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:21:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:21:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:21:40,223 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-26 08:21:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:40,224 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:21:40,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:21:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:21:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:21:40,225 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:40,225 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-09-26 08:21:40,226 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:40,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2018147699, now seen corresponding path program 18 times [2018-09-26 08:21:40,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:40,340 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:40,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:21:40,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:21:40,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:21:40,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:21:40,342 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-09-26 08:21:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:40,369 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:21:40,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:21:40,370 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-09-26 08:21:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:40,370 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:21:40,371 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:21:40,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 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:21:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:21:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:21:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:21:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:21:40,378 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-26 08:21:40,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:40,379 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:21:40,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:21:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:21:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:21:40,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:40,385 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-09-26 08:21:40,386 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:40,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:40,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1861930536, now seen corresponding path program 19 times [2018-09-26 08:21:40,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:40,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:40,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:21:40,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:21:40,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:21:40,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:21:40,531 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-09-26 08:21:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:40,561 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:21:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:21:40,561 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-09-26 08:21:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:40,562 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:21:40,565 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:21:40,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 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:21:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:21:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:21:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:21:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:21:40,575 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-26 08:21:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:40,575 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:21:40,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:21:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:21:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:21:40,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:40,578 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-09-26 08:21:40,578 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:40,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1885271533, now seen corresponding path program 20 times [2018-09-26 08:21:40,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:40,694 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:21:40,694 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:40,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:21:40,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:21:40,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:21:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:21:40,699 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-09-26 08:21:40,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:40,722 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:21:40,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:21:40,722 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-09-26 08:21:40,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:40,723 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:21:40,723 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:21:40,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 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:21:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:21:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:21:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:21:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:21:40,738 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-26 08:21:40,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:40,739 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:21:40,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:21:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:21:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:21:40,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:40,740 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-09-26 08:21:40,743 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:40,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:40,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1686124856, now seen corresponding path program 21 times [2018-09-26 08:21:40,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:40,868 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:40,868 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:21:40,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:21:40,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:21:40,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:21:40,870 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-09-26 08:21:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:40,890 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:21:40,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:21:40,890 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-09-26 08:21:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:40,891 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:21:40,891 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:21:40,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 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:21:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:21:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:21:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:21:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:21:40,896 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-26 08:21:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:40,897 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:21:40,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:21:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:21:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:21:40,898 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:40,898 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-09-26 08:21:40,898 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:40,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:40,899 INFO L82 PathProgramCache]: Analyzing trace with hash 730263219, now seen corresponding path program 22 times [2018-09-26 08:21:40,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:41,025 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:41,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:21:41,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:21:41,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:21:41,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:21:41,027 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-09-26 08:21:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:41,049 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:21:41,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:21:41,050 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-09-26 08:21:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:41,050 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:21:41,051 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:21:41,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 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:21:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:21:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:21:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:21:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:21:41,058 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-26 08:21:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:41,058 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:21:41,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:21:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:21:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:21:41,060 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:41,060 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-09-26 08:21:41,060 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:41,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:41,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1163323544, now seen corresponding path program 23 times [2018-09-26 08:21:41,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:41,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:41,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:21:41,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:21:41,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:21:41,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:21:41,249 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-09-26 08:21:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:41,275 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:21:41,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:21:41,275 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-09-26 08:21:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:41,276 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:21:41,276 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:21:41,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:21:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:21:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:21:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:21:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:21:41,282 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-26 08:21:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:41,282 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:21:41,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:21:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:21:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:21:41,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:41,283 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-09-26 08:21:41,285 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:41,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:41,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1703291731, now seen corresponding path program 24 times [2018-09-26 08:21:41,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:41,415 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:41,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:21:41,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:21:41,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:21:41,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:21:41,417 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-09-26 08:21:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:41,435 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:21:41,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:21:41,436 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-09-26 08:21:41,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:41,436 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:21:41,437 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:21:41,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 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:21:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:21:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:21:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:21:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:21:41,448 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-26 08:21:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:41,449 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:21:41,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:21:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:21:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:21:41,450 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:41,450 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-09-26 08:21:41,450 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:41,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1262436344, now seen corresponding path program 25 times [2018-09-26 08:21:41,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:41,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:41,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:21:41,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:21:41,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:21:41,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:21:41,585 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-09-26 08:21:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:41,602 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:21:41,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:21:41,602 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-09-26 08:21:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:41,603 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:21:41,603 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:21:41,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 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:21:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:21:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:21:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:21:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:21:41,610 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-26 08:21:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:41,611 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:21:41,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:21:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:21:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:21:41,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:41,612 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-09-26 08:21:41,612 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:41,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:41,616 INFO L82 PathProgramCache]: Analyzing trace with hash 480821235, now seen corresponding path program 26 times [2018-09-26 08:21:41,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:41,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:41,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:21:41,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:21:41,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:21:41,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:21:41,754 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-09-26 08:21:41,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:41,776 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:21:41,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:21:41,776 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-09-26 08:21:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:41,777 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:21:41,777 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:21:41,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 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:21:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:21:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:21:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:21:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:21:41,783 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-26 08:21:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:41,783 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:21:41,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:21:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:21:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:21:41,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:41,784 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-09-26 08:21:41,784 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:41,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:41,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2020556632, now seen corresponding path program 27 times [2018-09-26 08:21:41,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:41,947 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:41,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:21:41,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:21:41,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:21:41,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:21:41,949 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-09-26 08:21:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:41,974 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:21:41,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:21:41,975 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-09-26 08:21:41,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:41,975 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:21:41,975 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:21:41,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:21:41,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:21:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:21:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:21:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:21:41,984 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-26 08:21:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:41,984 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:21:41,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:21:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:21:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:21:41,985 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:41,985 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-09-26 08:21:41,985 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:41,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:41,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1787253613, now seen corresponding path program 28 times [2018-09-26 08:21:41,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:42,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:42,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:21:42,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:21:42,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:21:42,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:21:42,138 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-09-26 08:21:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:42,155 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:21:42,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:21:42,155 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-09-26 08:21:42,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:42,156 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:21:42,156 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:21:42,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 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:21:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:21:42,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:21:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:21:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:21:42,170 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-26 08:21:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:42,171 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:21:42,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:21:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:21:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:21:42,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:42,172 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-09-26 08:21:42,172 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:42,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:42,172 INFO L82 PathProgramCache]: Analyzing trace with hash 429713080, now seen corresponding path program 29 times [2018-09-26 08:21:42,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:42,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:42,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:21:42,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:21:42,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:21:42,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:21:42,431 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-09-26 08:21:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:42,450 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:21:42,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:21:42,451 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-09-26 08:21:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:42,451 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:21:42,451 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:21:42,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 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:21:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:21:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:21:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:21:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:21:42,461 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-26 08:21:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:42,461 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:21:42,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:21:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:21:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:21:42,462 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:42,462 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-09-26 08:21:42,462 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:42,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:42,465 INFO L82 PathProgramCache]: Analyzing trace with hash 436203827, now seen corresponding path program 30 times [2018-09-26 08:21:42,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:42,622 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:42,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:21:42,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:21:42,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:21:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:21:42,624 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-09-26 08:21:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:42,644 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:21:42,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:21:42,645 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-09-26 08:21:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:42,645 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:21:42,645 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:21:42,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 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:21:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:21:42,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:21:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:21:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:21:42,653 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-26 08:21:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:42,653 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:21:42,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:21:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:21:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:21:42,654 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:42,654 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-09-26 08:21:42,655 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:42,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:42,655 INFO L82 PathProgramCache]: Analyzing trace with hash 637416984, now seen corresponding path program 31 times [2018-09-26 08:21:42,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:42,826 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:42,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:21:42,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:21:42,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:21:42,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:21:42,828 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-09-26 08:21:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:42,846 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:21:42,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:21:42,847 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-09-26 08:21:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:42,847 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:21:42,847 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:21:42,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:21:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:21:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:21:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:21:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:21:42,851 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-26 08:21:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:42,851 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:21:42,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:21:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:21:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:21:42,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:42,852 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-09-26 08:21:42,852 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:42,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:42,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1714909741, now seen corresponding path program 32 times [2018-09-26 08:21:42,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:43,009 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:43,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:21:43,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:21:43,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:21:43,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:21:43,011 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-09-26 08:21:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:43,030 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:21:43,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:21:43,030 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-09-26 08:21:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:43,031 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:21:43,031 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:21:43,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 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:21:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:21:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:21:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:21:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:21:43,035 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-26 08:21:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:43,035 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:21:43,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:21:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:21:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:21:43,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:43,036 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-09-26 08:21:43,036 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:43,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1622594184, now seen corresponding path program 33 times [2018-09-26 08:21:43,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:43,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:43,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:21:43,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:21:43,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:21:43,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:21:43,199 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-09-26 08:21:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:43,220 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:21:43,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:21:43,220 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-09-26 08:21:43,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:43,220 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:21:43,221 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:21:43,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:21:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:21:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:21:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:21:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:21:43,224 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-26 08:21:43,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:43,225 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:21:43,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:21:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:21:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:21:43,225 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:43,225 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-09-26 08:21:43,226 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:43,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1239188083, now seen corresponding path program 34 times [2018-09-26 08:21:43,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:43,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:43,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:21:43,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:21:43,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:21:43,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:21:43,390 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-09-26 08:21:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:43,410 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:21:43,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:21:43,410 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-09-26 08:21:43,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:43,411 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:21:43,411 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:21:43,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:21:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:21:43,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:21:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:21:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:21:43,414 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-26 08:21:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:43,415 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:21:43,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:21:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:21:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:21:43,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:43,415 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-09-26 08:21:43,416 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:43,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:43,416 INFO L82 PathProgramCache]: Analyzing trace with hash -239874856, now seen corresponding path program 35 times [2018-09-26 08:21:43,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:43,584 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:43,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:21:43,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:21:43,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:21:43,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:21:43,586 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-09-26 08:21:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:43,607 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:21:43,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:21:43,607 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-09-26 08:21:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:43,608 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:21:43,608 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:21:43,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:21:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:21:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:21:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:21:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:21:43,612 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-26 08:21:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:43,612 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:21:43,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:21:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:21:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:21:43,613 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:43,613 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-09-26 08:21:43,613 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:43,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1153814291, now seen corresponding path program 36 times [2018-09-26 08:21:43,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:43,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:43,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:21:43,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:21:43,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:21:43,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:21:43,787 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-09-26 08:21:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:43,808 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:21:43,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:21:43,808 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-09-26 08:21:43,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:43,809 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:21:43,809 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:21:43,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:21:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:21:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:21:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:21:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:21:43,812 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-26 08:21:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:43,813 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:21:43,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:21:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:21:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:21:43,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:43,813 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-09-26 08:21:43,814 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:43,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1408504888, now seen corresponding path program 37 times [2018-09-26 08:21:43,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:43,991 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:43,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:21:43,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:21:43,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:21:43,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:21:43,993 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-09-26 08:21:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:44,016 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:21:44,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:21:44,016 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-09-26 08:21:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:44,017 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:21:44,017 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:21:44,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:21:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:21:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:21:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:21:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:21:44,021 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-26 08:21:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:44,021 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:21:44,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:21:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:21:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:21:44,022 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:44,022 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-09-26 08:21:44,022 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:44,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:44,023 INFO L82 PathProgramCache]: Analyzing trace with hash 713978803, now seen corresponding path program 38 times [2018-09-26 08:21:44,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:44,209 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:44,210 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:21:44,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:21:44,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:21:44,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:21:44,212 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-09-26 08:21:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:44,231 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:21:44,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:21:44,232 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-09-26 08:21:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:44,232 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:21:44,232 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:21:44,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:21:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:21:44,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:21:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:21:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:21:44,236 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-26 08:21:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:44,236 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:21:44,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:21:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:21:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:21:44,237 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:44,237 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-09-26 08:21:44,237 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:44,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash 658506648, now seen corresponding path program 39 times [2018-09-26 08:21:44,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:44,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:44,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:21:44,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:21:44,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:21:44,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:21:44,437 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-09-26 08:21:44,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:44,461 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:21:44,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:21:44,462 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-09-26 08:21:44,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:44,462 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:21:44,462 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:21:44,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:21:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:21:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:21:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:21:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:21:44,466 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-26 08:21:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:44,467 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:21:44,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:21:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:21:44,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:21:44,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:44,467 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-09-26 08:21:44,468 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:44,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:44,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1061130157, now seen corresponding path program 40 times [2018-09-26 08:21:44,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:44,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:44,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:21:44,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:21:44,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:21:44,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:21:44,706 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-09-26 08:21:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:44,734 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:21:44,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:21:44,734 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-09-26 08:21:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:44,735 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:21:44,735 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:21:44,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:21:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:21:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:21:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:21:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:21:44,740 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-26 08:21:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:44,740 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:21:44,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:21:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:21:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:21:44,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:44,741 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-09-26 08:21:44,741 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:44,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1464703736, now seen corresponding path program 41 times [2018-09-26 08:21:44,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:45,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:45,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:21:45,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:21:45,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:21:45,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:21:45,052 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-09-26 08:21:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:45,075 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:21:45,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:21:45,075 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-09-26 08:21:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:45,076 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:21:45,076 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:21:45,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:21:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:21:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:21:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:21:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:21:45,080 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-26 08:21:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:45,080 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:21:45,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:21:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:21:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:21:45,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:45,081 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-09-26 08:21:45,082 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:45,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1838824205, now seen corresponding path program 42 times [2018-09-26 08:21:45,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:45,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:45,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:21:45,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:21:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:21:45,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:21:45,292 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-09-26 08:21:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:45,319 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:21:45,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:21:45,319 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-09-26 08:21:45,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:45,320 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:21:45,320 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:21:45,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:21:45,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:21:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:21:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:21:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:21:45,324 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-26 08:21:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:45,325 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:21:45,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:21:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:21:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:21:45,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:45,325 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-09-26 08:21:45,326 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:45,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1168975272, now seen corresponding path program 43 times [2018-09-26 08:21:45,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:45,550 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:45,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:21:45,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:21:45,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:21:45,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:21:45,553 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-09-26 08:21:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:45,583 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:21:45,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:21:45,584 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-09-26 08:21:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:45,584 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:21:45,584 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:21:45,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:21:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:21:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:21:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:21:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:21:45,589 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-26 08:21:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:45,590 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:21:45,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:21:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:21:45,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:21:45,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:45,592 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-09-26 08:21:45,592 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:45,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:45,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1878494829, now seen corresponding path program 44 times [2018-09-26 08:21:45,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:45,835 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:45,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:21:45,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:21:45,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:21:45,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:21:45,837 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-09-26 08:21:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:45,864 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:21:45,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:21:45,864 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-09-26 08:21:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:45,865 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:21:45,865 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:21:45,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:21:45,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:21:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:21:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:21:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:21:45,869 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-26 08:21:45,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:45,869 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:21:45,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:21:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:21:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:21:45,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:45,870 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-09-26 08:21:45,870 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:45,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:45,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1896202680, now seen corresponding path program 45 times [2018-09-26 08:21:45,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:46,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:46,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:21:46,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:21:46,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:21:46,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:21:46,115 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-09-26 08:21:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:46,141 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:21:46,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:21:46,142 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-09-26 08:21:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:46,142 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:21:46,143 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:21:46,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:21:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:21:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:21:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:21:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:21:46,147 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-26 08:21:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:46,147 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:21:46,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:21:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:21:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:21:46,148 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:46,148 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-09-26 08:21:46,148 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:46,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:46,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1347258829, now seen corresponding path program 46 times [2018-09-26 08:21:46,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:46,410 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:46,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:21:46,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:21:46,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:21:46,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:21:46,412 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-09-26 08:21:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:46,445 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:21:46,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:21:46,446 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-09-26 08:21:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:46,446 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:21:46,446 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:21:46,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:21:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:21:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:21:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:21:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:21:46,450 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-26 08:21:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:46,450 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:21:46,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:21:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:21:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:21:46,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:46,451 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-09-26 08:21:46,452 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:46,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:46,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1184649496, now seen corresponding path program 47 times [2018-09-26 08:21:46,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:46,721 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:46,721 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:21:46,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:21:46,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:21:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:21:46,723 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-09-26 08:21:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:46,757 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:21:46,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:21:46,757 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-09-26 08:21:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:46,758 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:21:46,758 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:21:46,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:21:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:21:46,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:21:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:21:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:21:46,764 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-26 08:21:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:46,764 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:21:46,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:21:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:21:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:21:46,765 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:46,765 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-09-26 08:21:46,765 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:46,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:46,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1930571053, now seen corresponding path program 48 times [2018-09-26 08:21:46,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:47,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:47,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:21:47,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:21:47,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:21:47,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:21:47,047 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-09-26 08:21:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:47,083 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:21:47,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:21:47,083 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-09-26 08:21:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:47,084 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:21:47,084 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:21:47,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:21:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:21:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:21:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:21:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:21:47,089 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-26 08:21:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:47,089 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:21:47,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:21:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:21:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:21:47,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:47,090 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-09-26 08:21:47,090 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:47,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash 281839736, now seen corresponding path program 49 times [2018-09-26 08:21:47,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:47,384 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:47,385 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:21:47,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:21:47,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:21:47,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:21:47,387 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-09-26 08:21:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:47,426 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:21:47,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:21:47,426 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-09-26 08:21:47,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:47,427 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:21:47,427 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:21:47,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:21:47,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:21:47,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:21:47,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:21:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:21:47,432 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-26 08:21:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:47,432 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:21:47,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:21:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:21:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:21:47,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:47,433 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-09-26 08:21:47,434 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:47,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:47,434 INFO L82 PathProgramCache]: Analyzing trace with hash 147097459, now seen corresponding path program 50 times [2018-09-26 08:21:47,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:47,827 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:47,827 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:21:47,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:21:47,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:21:47,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:21:47,830 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-09-26 08:21:47,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:47,870 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:21:47,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:21:47,870 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-09-26 08:21:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:47,872 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:21:47,872 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:21:47,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:21:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:21:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:21:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:21:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:21:47,881 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-26 08:21:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:47,881 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:21:47,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:21:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:21:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:21:47,882 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:47,882 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-09-26 08:21:47,883 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:47,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:47,883 INFO L82 PathProgramCache]: Analyzing trace with hash 265054168, now seen corresponding path program 51 times [2018-09-26 08:21:47,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:48,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:48,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:21:48,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:21:48,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:21:48,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:21:48,302 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-09-26 08:21:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:48,335 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:21:48,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:21:48,336 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-09-26 08:21:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:48,336 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:21:48,337 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:21:48,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:21:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:21:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:21:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:21:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:21:48,341 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-26 08:21:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:48,341 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:21:48,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:21:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:21:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:21:48,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:48,344 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-09-26 08:21:48,344 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:48,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:48,345 INFO L82 PathProgramCache]: Analyzing trace with hash -373255149, now seen corresponding path program 52 times [2018-09-26 08:21:48,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:48,626 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:48,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:21:48,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:21:48,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:21:48,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:21:48,628 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-09-26 08:21:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:48,663 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:21:48,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:21:48,663 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-09-26 08:21:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:48,664 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:21:48,664 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:21:48,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:21:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:21:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:21:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:21:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:21:48,668 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-09-26 08:21:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:48,668 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:21:48,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:21:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:21:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:21:48,669 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:48,669 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-09-26 08:21:48,669 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:48,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1313992504, now seen corresponding path program 53 times [2018-09-26 08:21:48,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:48,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:48,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:21:48,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:21:48,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:21:48,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:21:48,946 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-09-26 08:21:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:48,978 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:21:48,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:21:48,978 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-09-26 08:21:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:48,979 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:21:48,979 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:21:48,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:21:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:21:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:21:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:21:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:21:48,983 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-09-26 08:21:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:48,984 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:21:48,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:21:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:21:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:21:48,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:48,985 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-09-26 08:21:48,985 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:48,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2079062195, now seen corresponding path program 54 times [2018-09-26 08:21:48,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:49,265 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:49,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:21:49,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:21:49,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:21:49,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:21:49,268 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-09-26 08:21:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:49,300 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:21:49,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:21:49,301 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-09-26 08:21:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:49,301 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:21:49,302 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:21:49,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 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:21:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:21:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:21:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:21:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:21:49,305 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-09-26 08:21:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:49,306 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:21:49,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:21:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:21:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:21:49,307 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:49,307 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-09-26 08:21:49,307 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:49,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:49,307 INFO L82 PathProgramCache]: Analyzing trace with hash 26418840, now seen corresponding path program 55 times [2018-09-26 08:21:49,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:49,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:49,585 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:21:49,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:21:49,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:21:49,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:21:49,588 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-09-26 08:21:49,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:49,632 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:21:49,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:21:49,632 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-09-26 08:21:49,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:49,633 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:21:49,633 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:21:49,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:21:49,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:21:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:21:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:21:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:21:49,637 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-09-26 08:21:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:49,637 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:21:49,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:21:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:21:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:21:49,638 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:49,638 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-09-26 08:21:49,638 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:49,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:49,639 INFO L82 PathProgramCache]: Analyzing trace with hash 818984275, now seen corresponding path program 56 times [2018-09-26 08:21:49,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:49,937 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:49,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:21:49,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:21:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:21:49,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:21:49,940 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-09-26 08:21:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:49,983 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:21:49,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:21:49,984 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-09-26 08:21:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:49,984 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:21:49,984 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:21:49,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:21:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:21:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:21:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:21:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:21:49,989 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-09-26 08:21:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:49,989 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:21:49,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:21:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:21:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:21:49,990 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:49,990 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-09-26 08:21:49,990 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:49,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:49,991 INFO L82 PathProgramCache]: Analyzing trace with hash -381291016, now seen corresponding path program 57 times [2018-09-26 08:21:49,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:50,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:50,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:21:50,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:21:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:21:50,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:21:50,302 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-09-26 08:21:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:50,334 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:21:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:21:50,335 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-09-26 08:21:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:50,335 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:21:50,336 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:21:50,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:21:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:21:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:21:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:21:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:21:50,340 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-09-26 08:21:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:50,340 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:21:50,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:21:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:21:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:21:50,341 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:50,341 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-09-26 08:21:50,342 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:50,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1064880627, now seen corresponding path program 58 times [2018-09-26 08:21:50,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:50,677 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:50,677 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:21:50,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:21:50,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:21:50,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:21:50,680 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-09-26 08:21:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:50,729 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:21:50,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:21:50,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-09-26 08:21:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:50,730 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:21:50,730 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:21:50,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:21:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:21:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:21:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:21:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:21:50,735 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-09-26 08:21:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:50,735 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:21:50,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:21:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:21:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:21:50,736 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:50,736 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-09-26 08:21:50,737 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:50,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:50,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1348438696, now seen corresponding path program 59 times [2018-09-26 08:21:50,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:51,119 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:51,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:21:51,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:21:51,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:21:51,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:21:51,122 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-09-26 08:21:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:51,160 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:21:51,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:21:51,161 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-09-26 08:21:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:51,161 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:21:51,162 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:21:51,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:21:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:21:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:21:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:21:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:21:51,167 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-09-26 08:21:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:51,167 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:21:51,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:21:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:21:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:21:51,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:51,168 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-09-26 08:21:51,168 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:51,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:51,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1148073619, now seen corresponding path program 60 times [2018-09-26 08:21:51,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:51,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:51,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:21:51,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:21:51,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:21:51,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:21:51,580 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-09-26 08:21:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:51,630 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:21:51,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:21:51,630 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-09-26 08:21:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:51,631 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:21:51,631 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:21:51,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:21:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:21:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:21:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:21:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:21:51,635 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-09-26 08:21:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:51,636 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:21:51,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:21:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:21:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:21:51,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:51,637 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-09-26 08:21:51,637 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:51,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:51,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1230544056, now seen corresponding path program 61 times [2018-09-26 08:21:51,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:51,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:51,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:21:51,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:21:51,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:21:51,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:21:51,956 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-09-26 08:21:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:51,997 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:21:51,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:21:51,997 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-09-26 08:21:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:51,998 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:21:51,998 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:21:52,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:21:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:21:52,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:21:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:21:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:21:52,003 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-09-26 08:21:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:52,003 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:21:52,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:21:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:21:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:21:52,004 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:52,004 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-09-26 08:21:52,004 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:52,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:52,005 INFO L82 PathProgramCache]: Analyzing trace with hash -507839693, now seen corresponding path program 62 times [2018-09-26 08:21:52,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:52,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:52,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:21:52,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:21:52,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:21:52,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:21:52,334 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-09-26 08:21:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:52,383 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:21:52,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:21:52,383 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-09-26 08:21:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:52,384 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:21:52,384 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:21:52,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:21:52,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:21:52,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:21:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:21:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:21:52,389 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-09-26 08:21:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:52,389 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:21:52,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:21:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:21:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:21:52,390 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:52,390 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-09-26 08:21:52,390 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:52,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:52,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1436838936, now seen corresponding path program 63 times [2018-09-26 08:21:52,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:52,713 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:52,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:21:52,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:21:52,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:21:52,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:21:52,717 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-09-26 08:21:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:52,753 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:21:52,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:21:52,754 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-09-26 08:21:52,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:52,754 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:21:52,755 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:21:52,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:21:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:21:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:21:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:21:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:21:52,761 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-09-26 08:21:52,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:52,762 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:21:52,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:21:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:21:52,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:21:52,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:52,763 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-09-26 08:21:52,763 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:52,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:52,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1592334291, now seen corresponding path program 64 times [2018-09-26 08:21:52,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:53,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:53,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:21:53,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:21:53,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:21:53,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:21:53,085 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-09-26 08:21:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:53,129 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:21:53,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:21:53,130 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-09-26 08:21:53,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:53,130 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:21:53,131 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:21:53,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:21:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:21:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:21:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:21:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:21:53,135 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-09-26 08:21:53,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:53,135 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:21:53,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:21:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:21:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:21:53,136 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:53,136 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-09-26 08:21:53,136 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:53,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:53,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2117723000, now seen corresponding path program 65 times [2018-09-26 08:21:53,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:53,469 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:53,470 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:21:53,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:21:53,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:21:53,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:21:53,472 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-09-26 08:21:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:53,529 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:21:53,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:21:53,529 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-09-26 08:21:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:53,530 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:21:53,530 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:21:53,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:21:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:21:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:21:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:21:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:21:53,534 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-09-26 08:21:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:53,534 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:21:53,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:21:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:21:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:21:53,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:53,535 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-09-26 08:21:53,535 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:53,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1224903795, now seen corresponding path program 66 times [2018-09-26 08:21:53,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:53,900 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:53,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:21:53,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:21:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:21:53,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:21:53,903 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-09-26 08:21:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:53,941 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:21:53,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:21:53,941 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-09-26 08:21:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:53,942 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:21:53,942 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:21:53,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:21:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:21:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:21:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:21:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:21:53,947 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-09-26 08:21:53,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:53,947 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:21:53,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:21:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:21:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:21:53,948 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:53,948 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-09-26 08:21:53,948 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:53,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:53,949 INFO L82 PathProgramCache]: Analyzing trace with hash -682687784, now seen corresponding path program 67 times [2018-09-26 08:21:53,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:54,385 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:54,385 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:21:54,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:21:54,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:21:54,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:21:54,387 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-09-26 08:21:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:54,451 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:21:54,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:21:54,451 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-09-26 08:21:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:54,452 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:21:54,452 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:21:54,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:21:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:21:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:21:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:21:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:21:54,456 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-09-26 08:21:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:54,457 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:21:54,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:21:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:21:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:21:54,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:54,458 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-09-26 08:21:54,458 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:54,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:54,458 INFO L82 PathProgramCache]: Analyzing trace with hash 311515411, now seen corresponding path program 68 times [2018-09-26 08:21:54,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:54,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:54,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:21:54,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:21:54,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:21:54,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:21:54,843 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-09-26 08:21:54,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:54,898 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:21:54,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:21:54,899 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-09-26 08:21:54,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:54,899 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:21:54,900 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:21:54,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:21:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:21:54,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:21:54,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:21:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:21:54,903 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-09-26 08:21:54,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:54,904 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:21:54,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:21:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:21:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:21:54,905 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:54,905 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-09-26 08:21:54,905 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:54,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:54,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1067043384, now seen corresponding path program 69 times [2018-09-26 08:21:54,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:55,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:55,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:21:55,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:21:55,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:21:55,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:21:55,271 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-09-26 08:21:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:55,333 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:21:55,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:21:55,334 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-09-26 08:21:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:55,334 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:21:55,334 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:21:55,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:21:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:21:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:21:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:21:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:21:55,338 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-09-26 08:21:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:55,339 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:21:55,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:21:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:21:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:21:55,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:55,340 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-09-26 08:21:55,340 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:55,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:55,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1281393229, now seen corresponding path program 70 times [2018-09-26 08:21:55,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:55,675 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:55,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:21:55,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:21:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:21:55,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:21:55,678 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-09-26 08:21:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:55,735 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:21:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:21:55,735 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-09-26 08:21:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:55,736 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:21:55,736 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:21:55,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:21:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:21:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:21:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:21:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:21:55,740 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-09-26 08:21:55,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:55,740 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:21:55,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:21:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:21:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:21:55,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:55,741 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-09-26 08:21:55,742 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:55,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1068484200, now seen corresponding path program 71 times [2018-09-26 08:21:55,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:56,100 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:56,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:21:56,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:21:56,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:21:56,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:21:56,102 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-09-26 08:21:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:56,161 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:21:56,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:21:56,161 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-09-26 08:21:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:56,162 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:21:56,162 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:21:56,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:21:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:21:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:21:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:21:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:21:56,167 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-09-26 08:21:56,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:56,167 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:21:56,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:21:56,167 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:21:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:21:56,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:56,168 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-09-26 08:21:56,168 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:56,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:56,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1236728403, now seen corresponding path program 72 times [2018-09-26 08:21:56,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:56,553 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:56,553 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:21:56,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:21:56,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:21:56,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:21:56,556 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-09-26 08:21:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:56,602 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:21:56,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:21:56,602 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-09-26 08:21:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:56,603 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:21:56,603 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:21:56,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:21:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:21:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:21:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:21:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:21:56,607 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-09-26 08:21:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:56,607 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:21:56,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:21:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:21:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:21:56,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:56,608 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-09-26 08:21:56,609 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:56,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash -316124936, now seen corresponding path program 73 times [2018-09-26 08:21:56,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:57,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:57,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:21:57,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:21:57,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:21:57,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:21:57,029 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-09-26 08:21:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:57,077 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:21:57,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:21:57,078 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-09-26 08:21:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:57,078 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:21:57,079 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:21:57,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:21:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:21:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:21:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:21:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:21:57,083 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-09-26 08:21:57,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:57,083 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:21:57,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:21:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:21:57,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:21:57,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:57,085 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-09-26 08:21:57,085 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:57,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:57,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1209938189, now seen corresponding path program 74 times [2018-09-26 08:21:57,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:57,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:57,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:21:57,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:21:57,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:21:57,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:21:57,597 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-09-26 08:21:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:57,639 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:21:57,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:21:57,640 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-09-26 08:21:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:57,641 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:21:57,641 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:21:57,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:21:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:21:57,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:21:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:21:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:21:57,645 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-09-26 08:21:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:57,645 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:21:57,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:21:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:21:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:21:57,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:57,646 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-09-26 08:21:57,646 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:57,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1146622040, now seen corresponding path program 75 times [2018-09-26 08:21:57,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:58,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:58,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:21:58,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:21:58,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:21:58,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:21:58,016 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-09-26 08:21:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:58,072 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:21:58,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:21:58,073 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-09-26 08:21:58,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:58,073 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:21:58,074 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:21:58,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:21:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:21:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:21:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:21:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:21:58,078 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-09-26 08:21:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:58,078 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:21:58,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:21:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:21:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:21:58,079 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:58,079 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-09-26 08:21:58,080 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:58,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1185545107, now seen corresponding path program 76 times [2018-09-26 08:21:58,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:58,463 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:58,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:21:58,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:21:58,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:21:58,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:21:58,465 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-09-26 08:21:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:58,531 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:21:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:21:58,531 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-09-26 08:21:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:58,532 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:21:58,532 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:21:58,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:21:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:21:58,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:21:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:21:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:21:58,537 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-09-26 08:21:58,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:58,538 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:21:58,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:21:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:21:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:21:58,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:58,539 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-09-26 08:21:58,539 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:58,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:58,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1902807112, now seen corresponding path program 77 times [2018-09-26 08:21:58,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:58,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:58,907 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:21:58,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:21:58,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:21:58,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:21:58,909 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-09-26 08:21:58,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:58,996 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:21:58,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:21:58,996 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-09-26 08:21:58,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:58,997 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:21:58,997 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:21:58,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:21:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:21:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:21:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:21:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:21:59,001 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-09-26 08:21:59,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:59,002 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:21:59,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:21:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:21:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:21:59,003 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:59,003 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-09-26 08:21:59,003 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:59,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:59,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1142521907, now seen corresponding path program 78 times [2018-09-26 08:21:59,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:59,371 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:59,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:21:59,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:21:59,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:21:59,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:21:59,374 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-09-26 08:21:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:59,451 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:21:59,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:21:59,451 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-09-26 08:21:59,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:59,452 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:21:59,452 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:21:59,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:21:59,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:21:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:21:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:21:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:21:59,456 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-09-26 08:21:59,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:59,457 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:21:59,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:21:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:21:59,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:21:59,458 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:59,458 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-09-26 08:21:59,458 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:59,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:59,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1058440984, now seen corresponding path program 79 times [2018-09-26 08:21:59,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:59,828 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:59,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:21:59,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:21:59,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:21:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:21:59,831 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-09-26 08:21:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:59,900 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:21:59,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:21:59,900 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-09-26 08:21:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:59,901 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:21:59,901 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:21:59,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:21:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:21:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:21:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:21:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:21:59,905 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-09-26 08:21:59,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:59,906 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:21:59,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:21:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:21:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:21:59,906 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:59,907 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-09-26 08:21:59,907 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:59,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:59,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1548067629, now seen corresponding path program 80 times [2018-09-26 08:21:59,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:00,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:00,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:22:00,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:22:00,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:22:00,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:22:00,265 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-09-26 08:22:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:00,349 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:22:00,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:22:00,349 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-09-26 08:22:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:00,350 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:22:00,350 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:22:00,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:22:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:22:00,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:22:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:22:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:22:00,354 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-09-26 08:22:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:00,354 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:22:00,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:22:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:22:00,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:22:00,355 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:00,355 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-09-26 08:22:00,355 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:00,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:00,356 INFO L82 PathProgramCache]: Analyzing trace with hash -745456008, now seen corresponding path program 81 times [2018-09-26 08:22:00,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:00,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:00,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:22:00,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:22:00,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:22:00,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:22:00,717 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-09-26 08:22:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:00,801 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:22:00,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:22:00,801 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-09-26 08:22:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:00,802 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:22:00,802 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:22:00,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:22:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:22:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:22:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:22:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:22:00,806 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-09-26 08:22:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:00,806 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:22:00,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:22:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:22:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:22:00,807 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:00,807 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-09-26 08:22:00,807 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:00,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1634299533, now seen corresponding path program 82 times [2018-09-26 08:22:00,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:01,174 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:01,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:22:01,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:22:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:22:01,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:22:01,176 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-09-26 08:22:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:01,256 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:22:01,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:22:01,256 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-09-26 08:22:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:01,257 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:22:01,257 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:22:01,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:22:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:22:01,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:22:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:22:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:22:01,262 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-09-26 08:22:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:01,262 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:22:01,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:22:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:22:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:22:01,263 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:01,263 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1] [2018-09-26 08:22:01,263 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:01,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:01,263 INFO L82 PathProgramCache]: Analyzing trace with hash 876322264, now seen corresponding path program 83 times [2018-09-26 08:22:01,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:01,646 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:01,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:22:01,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:22:01,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:22:01,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:22:01,648 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-09-26 08:22:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:01,693 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:22:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:22:01,693 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-09-26 08:22:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:01,694 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:22:01,694 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:22:01,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:22:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:22:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:22:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:22:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:22:01,699 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-09-26 08:22:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:01,699 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:22:01,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:22:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:22:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:22:01,700 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:01,700 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1] [2018-09-26 08:22:01,700 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:01,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1396186643, now seen corresponding path program 84 times [2018-09-26 08:22:01,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:02,066 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:02,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:22:02,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:22:02,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:22:02,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:22:02,068 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-09-26 08:22:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:02,166 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:22:02,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:22:02,166 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-09-26 08:22:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:02,167 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:22:02,167 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:22:02,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:22:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:22:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:22:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:22:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:22:02,171 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-09-26 08:22:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:02,172 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:22:02,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:22:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:22:02,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:22:02,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:02,173 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1] [2018-09-26 08:22:02,173 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:02,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash 332113208, now seen corresponding path program 85 times [2018-09-26 08:22:02,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:02,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:02,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:22:02,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:22:02,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:22:02,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:22:02,543 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-09-26 08:22:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:02,598 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:22:02,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:22:02,598 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-09-26 08:22:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:02,599 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:22:02,599 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:22:02,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:22:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:22:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:22:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:22:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:22:02,603 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-09-26 08:22:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:02,604 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:22:02,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:22:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:22:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:22:02,605 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:02,605 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1] [2018-09-26 08:22:02,605 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:02,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:02,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1705575091, now seen corresponding path program 86 times [2018-09-26 08:22:02,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:03,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:03,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:22:03,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:22:03,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:22:03,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:22:03,039 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-09-26 08:22:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:03,144 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:22:03,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:22:03,144 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-09-26 08:22:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:03,145 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:22:03,145 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:22:03,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:22:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:22:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:22:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:22:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:22:03,150 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-09-26 08:22:03,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:03,150 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:22:03,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:22:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:22:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:22:03,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:03,152 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1] [2018-09-26 08:22:03,152 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:03,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:03,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1333220504, now seen corresponding path program 87 times [2018-09-26 08:22:03,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:03,664 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:03,665 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:22:03,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:22:03,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:22:03,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:22:03,666 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-09-26 08:22:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:03,718 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:22:03,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:22:03,718 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-09-26 08:22:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:03,719 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:22:03,719 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:22:03,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:22:03,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:22:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:22:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:22:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:22:03,723 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-09-26 08:22:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:03,723 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:22:03,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:22:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:22:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:22:03,724 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:03,725 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1] [2018-09-26 08:22:03,725 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:03,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:03,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1619837101, now seen corresponding path program 88 times [2018-09-26 08:22:03,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:04,119 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:04,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:22:04,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:22:04,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:22:04,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:22:04,121 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-09-26 08:22:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:04,230 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:22:04,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:22:04,230 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-09-26 08:22:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:04,231 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:22:04,231 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:22:04,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:22:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:22:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:22:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:22:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:22:04,235 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-09-26 08:22:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:04,236 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:22:04,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:22:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:22:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:22:04,236 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:04,237 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1] [2018-09-26 08:22:04,237 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:04,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:04,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1324657656, now seen corresponding path program 89 times [2018-09-26 08:22:04,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:04,613 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:04,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:22:04,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:22:04,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:22:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:22:04,615 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-09-26 08:22:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:04,669 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:22:04,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:22:04,670 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-09-26 08:22:04,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:04,670 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:22:04,671 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:22:04,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:22:04,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:22:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:22:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:22:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:22:04,674 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-09-26 08:22:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:04,675 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:22:04,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:22:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:22:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:22:04,675 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:04,676 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1] [2018-09-26 08:22:04,676 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:04,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:04,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1885285389, now seen corresponding path program 90 times [2018-09-26 08:22:04,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:05,121 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:05,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:22:05,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:22:05,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:22:05,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:22:05,124 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-09-26 08:22:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:05,236 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:22:05,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:22:05,236 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-09-26 08:22:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:05,237 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:22:05,237 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:22:05,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:22:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:22:05,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:22:05,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:22:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-26 08:22:05,242 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-09-26 08:22:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:05,242 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-26 08:22:05,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:22:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-26 08:22:05,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:22:05,243 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:05,243 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1] [2018-09-26 08:22:05,246 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:05,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:05,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1685695320, now seen corresponding path program 91 times [2018-09-26 08:22:05,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:05,754 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:05,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:22:05,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:22:05,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:22:05,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:22:05,757 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-09-26 08:22:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:05,894 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:22:05,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:22:05,894 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-09-26 08:22:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:05,895 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:22:05,895 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:22:05,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:22:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:22:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:22:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:22:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:22:05,899 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-09-26 08:22:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:05,900 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:22:05,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:22:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:22:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:22:05,900 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:05,900 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1] [2018-09-26 08:22:05,901 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:05,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:05,901 INFO L82 PathProgramCache]: Analyzing trace with hash 716947603, now seen corresponding path program 92 times [2018-09-26 08:22:05,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:06,310 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:06,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:22:06,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:22:06,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:22:06,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:22:06,312 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-09-26 08:22:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:06,377 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:22:06,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:22:06,377 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-09-26 08:22:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:06,378 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:22:06,378 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:22:06,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:22:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:22:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:22:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:22:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:22:06,382 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-09-26 08:22:06,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:06,382 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:22:06,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:22:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:22:06,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:22:06,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:06,383 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1] [2018-09-26 08:22:06,383 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:06,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:06,383 INFO L82 PathProgramCache]: Analyzing trace with hash 750539448, now seen corresponding path program 93 times [2018-09-26 08:22:06,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:06,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:06,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:22:06,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:22:06,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:22:06,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:22:06,795 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-09-26 08:22:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:06,840 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:22:06,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:22:06,840 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-09-26 08:22:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:06,841 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:22:06,841 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:22:06,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:22:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:22:06,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:22:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:22:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:22:06,845 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-09-26 08:22:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:06,845 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:22:06,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:22:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:22:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:22:06,846 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:06,846 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1] [2018-09-26 08:22:06,846 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:06,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:06,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1791886643, now seen corresponding path program 94 times [2018-09-26 08:22:06,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:07,231 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:07,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:22:07,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:22:07,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:22:07,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:22:07,234 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-09-26 08:22:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:07,341 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:22:07,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:22:07,342 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-09-26 08:22:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:07,343 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:22:07,343 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:22:07,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:22:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:22:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:22:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:22:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:22:07,347 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-09-26 08:22:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:07,347 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:22:07,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:22:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:22:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:22:07,348 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:07,348 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1] [2018-09-26 08:22:07,348 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:07,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:07,348 INFO L82 PathProgramCache]: Analyzing trace with hash -286088680, now seen corresponding path program 95 times [2018-09-26 08:22:07,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:07,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:07,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:22:07,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:22:07,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:22:07,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:22:07,786 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-09-26 08:22:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:07,887 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:22:07,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:22:07,888 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-09-26 08:22:07,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:07,888 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:22:07,889 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:22:07,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:22:07,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:22:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:22:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:22:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:22:07,893 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-09-26 08:22:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:07,894 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:22:07,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:22:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:22:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:22:07,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:07,896 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1] [2018-09-26 08:22:07,896 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:07,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:07,897 INFO L82 PathProgramCache]: Analyzing trace with hash -278814253, now seen corresponding path program 96 times [2018-09-26 08:22:07,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:08,339 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:08,339 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:22:08,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:22:08,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:22:08,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:22:08,340 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-09-26 08:22:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:08,441 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:22:08,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:22:08,441 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-09-26 08:22:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:08,442 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:22:08,442 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:22:08,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:22:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:22:08,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:22:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:22:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-26 08:22:08,446 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-09-26 08:22:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:08,447 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-26 08:22:08,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:22:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-26 08:22:08,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:22:08,447 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:08,447 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1] [2018-09-26 08:22:08,448 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:08,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:08,448 INFO L82 PathProgramCache]: Analyzing trace with hash -53307016, now seen corresponding path program 97 times [2018-09-26 08:22:08,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:08,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:08,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:22:08,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:22:08,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:22:08,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:22:08,762 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-09-26 08:22:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:08,855 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:22:08,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:22:08,855 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-09-26 08:22:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:08,856 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:22:08,856 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:22:08,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 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:22:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:22:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:22:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:22:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:22:08,859 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-09-26 08:22:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:08,860 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:22:08,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:22:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:22:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:22:08,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:08,861 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1] [2018-09-26 08:22:08,861 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:08,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1652517261, now seen corresponding path program 98 times [2018-09-26 08:22:08,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:09,273 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:09,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:22:09,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:22:09,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:22:09,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:22:09,275 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-09-26 08:22:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:09,356 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:22:09,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:22:09,356 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-09-26 08:22:09,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:09,357 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:22:09,357 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:22:09,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:22:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:22:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-26 08:22:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:22:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 08:22:09,363 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-09-26 08:22:09,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:09,363 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 08:22:09,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:22:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 08:22:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:22:09,363 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:09,364 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1] [2018-09-26 08:22:09,364 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:09,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:09,364 INFO L82 PathProgramCache]: Analyzing trace with hash 311572696, now seen corresponding path program 99 times [2018-09-26 08:22:09,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:09,774 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:09,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:22:09,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:22:09,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:22:09,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:22:09,777 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-09-26 08:22:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:09,848 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:22:09,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:22:09,849 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-09-26 08:22:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:09,849 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:22:09,849 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:22:09,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:22:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:22:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:22:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:22:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:22:09,853 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-09-26 08:22:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:09,854 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:22:09,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:22:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:22:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:22:09,854 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:09,855 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1] [2018-09-26 08:22:09,855 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:09,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1068819219, now seen corresponding path program 100 times [2018-09-26 08:22:09,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:11,164 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:11,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:22:11,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:22:11,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:22:11,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:22:11,166 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-09-26 08:22:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:12,502 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:22:12,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:22:12,502 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-09-26 08:22:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:12,503 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:22:12,503 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:22:12,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:22:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:22:12,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:22:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:22:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:22:12,511 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-09-26 08:22:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:12,512 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:22:12,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:22:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:22:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:22:12,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:12,513 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1] [2018-09-26 08:22:12,513 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:12,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1226342344, now seen corresponding path program 101 times [2018-09-26 08:22:12,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:13,460 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:13,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:22:13,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:22:13,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:22:13,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:22:13,462 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-09-26 08:22:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:14,550 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:22:14,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:22:14,550 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-09-26 08:22:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:14,551 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:22:14,552 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:22:14,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:22:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:22:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:22:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:22:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:22:14,560 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-09-26 08:22:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:14,560 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:22:14,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:22:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:22:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:22:14,561 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:14,561 INFO L375 BasicCegarLoop]: trace histogram [102, 1, 1] [2018-09-26 08:22:14,562 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:14,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash 638093235, now seen corresponding path program 102 times [2018-09-26 08:22:14,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:15,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:15,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:22:15,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:22:15,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:22:15,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:22:15,526 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 105 states. [2018-09-26 08:22:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:16,817 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:22:16,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:22:16,817 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 104 [2018-09-26 08:22:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:16,818 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:22:16,818 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:22:16,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:22:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:22:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-26 08:22:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:22:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 08:22:16,831 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-09-26 08:22:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:16,831 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 08:22:16,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:22:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 08:22:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:22:16,832 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:16,832 INFO L375 BasicCegarLoop]: trace histogram [103, 1, 1] [2018-09-26 08:22:16,833 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:16,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:16,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1693945960, now seen corresponding path program 103 times [2018-09-26 08:22:16,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:17,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:17,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:22:17,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:22:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:22:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:22:17,733 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2018-09-26 08:22:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:18,659 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:22:18,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:22:18,659 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2018-09-26 08:22:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:18,660 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:22:18,660 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:22:18,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:22:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:22:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:22:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:22:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:22:18,669 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-09-26 08:22:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:18,669 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:22:18,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:22:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:22:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:22:18,670 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:18,670 INFO L375 BasicCegarLoop]: trace histogram [104, 1, 1] [2018-09-26 08:22:18,670 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:18,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:18,670 INFO L82 PathProgramCache]: Analyzing trace with hash -972716973, now seen corresponding path program 104 times [2018-09-26 08:22:18,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:19,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:19,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:22:19,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:22:19,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:22:19,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:22:19,715 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 107 states. [2018-09-26 08:22:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:20,550 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:22:20,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:22:20,550 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 106 [2018-09-26 08:22:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:20,551 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:22:20,551 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 08:22:20,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:22:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 08:22:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-09-26 08:22:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:22:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-09-26 08:22:20,558 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-09-26 08:22:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:20,558 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-09-26 08:22:20,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:22:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-09-26 08:22:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 08:22:20,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:20,559 INFO L375 BasicCegarLoop]: trace histogram [105, 1, 1] [2018-09-26 08:22:20,559 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:20,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash -89454856, now seen corresponding path program 105 times [2018-09-26 08:22:20,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:21,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:21,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:22:21,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:22:21,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:22:21,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:22:21,478 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2018-09-26 08:22:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:22,408 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:22:22,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:22:22,408 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2018-09-26 08:22:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:22,409 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:22:22,409 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:22:22,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:22:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:22:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:22:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:22:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:22:22,417 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-09-26 08:22:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:22,417 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:22:22,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:22:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:22:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:22:22,418 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:22,418 INFO L375 BasicCegarLoop]: trace histogram [106, 1, 1] [2018-09-26 08:22:22,418 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:22,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:22,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1521866995, now seen corresponding path program 106 times [2018-09-26 08:22:22,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:23,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:23,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:22:23,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:22:23,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:22:23,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:22:23,254 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 109 states. [2018-09-26 08:22:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:24,121 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:22:24,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:22:24,121 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 108 [2018-09-26 08:22:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:24,122 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:22:24,122 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:22:24,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:22:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:22:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-26 08:22:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:22:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-09-26 08:22:24,130 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-09-26 08:22:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:24,130 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-09-26 08:22:24,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:22:24,130 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-09-26 08:22:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:22:24,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:24,131 INFO L375 BasicCegarLoop]: trace histogram [107, 1, 1] [2018-09-26 08:22:24,131 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:24,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:24,131 INFO L82 PathProgramCache]: Analyzing trace with hash -66763176, now seen corresponding path program 107 times [2018-09-26 08:22:24,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:24,815 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:24,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:22:24,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:22:24,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:22:24,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:22:24,816 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2018-09-26 08:22:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:25,650 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-09-26 08:22:25,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:22:25,651 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2018-09-26 08:22:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:25,652 INFO L225 Difference]: With dead ends: 112 [2018-09-26 08:22:25,652 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:22:25,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:22:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:22:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:22:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:22:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:22:25,660 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-09-26 08:22:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:25,660 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:22:25,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:22:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:22:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:22:25,661 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:25,661 INFO L375 BasicCegarLoop]: trace histogram [108, 1, 1] [2018-09-26 08:22:25,662 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:25,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:25,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2069658221, now seen corresponding path program 108 times [2018-09-26 08:22:25,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:26,602 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:26,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:22:26,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:22:26,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:22:26,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:22:26,604 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 111 states. [2018-09-26 08:22:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:27,537 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:22:27,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:22:27,537 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 110 [2018-09-26 08:22:27,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:27,538 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:22:27,538 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:22:27,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:22:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:22:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-09-26 08:22:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:22:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-09-26 08:22:27,549 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-09-26 08:22:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:27,550 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-09-26 08:22:27,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:22:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-09-26 08:22:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:22:27,552 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:27,552 INFO L375 BasicCegarLoop]: trace histogram [109, 1, 1] [2018-09-26 08:22:27,552 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:27,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:27,553 INFO L82 PathProgramCache]: Analyzing trace with hash 265104824, now seen corresponding path program 109 times [2018-09-26 08:22:27,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:28,290 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:28,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:22:28,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:22:28,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:22:28,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:22:28,292 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2018-09-26 08:22:29,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:29,144 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-09-26 08:22:29,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:22:29,144 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2018-09-26 08:22:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:29,145 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:22:29,145 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:22:29,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:22:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:22:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:22:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:22:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:22:29,154 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-09-26 08:22:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:29,154 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:22:29,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:22:29,155 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:22:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:22:29,155 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:29,155 INFO L375 BasicCegarLoop]: trace histogram [110, 1, 1] [2018-09-26 08:22:29,156 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:29,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:29,156 INFO L82 PathProgramCache]: Analyzing trace with hash -371684813, now seen corresponding path program 110 times [2018-09-26 08:22:29,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:29,830 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:29,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:22:29,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:22:29,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:22:29,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:22:29,831 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 113 states. [2018-09-26 08:22:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:30,716 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:22:30,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:22:30,716 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 112 [2018-09-26 08:22:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:30,717 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:22:30,717 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:22:30,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:22:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:22:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-09-26 08:22:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:22:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-09-26 08:22:30,725 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-09-26 08:22:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:30,725 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-09-26 08:22:30,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:22:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-09-26 08:22:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-26 08:22:30,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:30,726 INFO L375 BasicCegarLoop]: trace histogram [111, 1, 1] [2018-09-26 08:22:30,727 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:30,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:30,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1362672920, now seen corresponding path program 111 times [2018-09-26 08:22:30,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:31,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:31,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:22:31,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:22:31,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:22:31,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:22:31,418 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2018-09-26 08:22:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:32,280 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:22:32,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:22:32,280 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2018-09-26 08:22:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:32,280 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:22:32,280 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:22:32,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:22:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:22:32,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:22:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:22:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:22:32,288 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-09-26 08:22:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:32,288 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:22:32,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:22:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:22:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:22:32,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:32,289 INFO L375 BasicCegarLoop]: trace histogram [112, 1, 1] [2018-09-26 08:22:32,289 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:32,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:32,290 INFO L82 PathProgramCache]: Analyzing trace with hash -706812205, now seen corresponding path program 112 times [2018-09-26 08:22:32,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:33,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:33,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:22:33,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:22:33,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:22:33,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:22:33,058 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 115 states. [2018-09-26 08:22:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:33,971 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:22:33,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:22:33,971 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 114 [2018-09-26 08:22:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:33,972 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:22:33,972 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:22:33,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:22:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:22:33,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-09-26 08:22:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:22:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 08:22:33,981 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-09-26 08:22:33,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:33,981 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 08:22:33,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:22:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 08:22:33,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:22:33,982 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:33,982 INFO L375 BasicCegarLoop]: trace histogram [113, 1, 1] [2018-09-26 08:22:33,983 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:33,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:33,983 INFO L82 PathProgramCache]: Analyzing trace with hash -436341640, now seen corresponding path program 113 times [2018-09-26 08:22:33,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:34,692 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:34,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:22:34,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:22:34,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:22:34,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:22:34,694 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2018-09-26 08:22:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:35,719 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-09-26 08:22:35,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:22:35,720 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2018-09-26 08:22:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:35,721 INFO L225 Difference]: With dead ends: 118 [2018-09-26 08:22:35,721 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:22:35,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:22:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:22:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:22:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:22:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:22:35,730 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-09-26 08:22:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:35,730 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:22:35,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:22:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:22:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:22:35,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:35,731 INFO L375 BasicCegarLoop]: trace histogram [114, 1, 1] [2018-09-26 08:22:35,731 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:35,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash -641688717, now seen corresponding path program 114 times [2018-09-26 08:22:35,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:36,511 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:36,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:22:36,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:22:36,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:22:36,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:22:36,513 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 117 states. [2018-09-26 08:22:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:37,432 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 08:22:37,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:22:37,432 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 116 [2018-09-26 08:22:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:37,433 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:22:37,433 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:22:37,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:22:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:22:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-09-26 08:22:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:22:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-09-26 08:22:37,442 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-09-26 08:22:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:37,442 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-09-26 08:22:37,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:22:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-09-26 08:22:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-26 08:22:37,443 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:37,443 INFO L375 BasicCegarLoop]: trace histogram [115, 1, 1] [2018-09-26 08:22:37,443 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:37,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:37,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1582486488, now seen corresponding path program 115 times [2018-09-26 08:22:37,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:38,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:38,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:22:38,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:22:38,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:22:38,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:22:38,138 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2018-09-26 08:22:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:39,375 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 08:22:39,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:22:39,375 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2018-09-26 08:22:39,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:39,376 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:22:39,376 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:22:39,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:22:39,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:22:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:22:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:22:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:22:39,385 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-09-26 08:22:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:39,385 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:22:39,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:22:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:22:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:22:39,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:39,386 INFO L375 BasicCegarLoop]: trace histogram [116, 1, 1] [2018-09-26 08:22:39,386 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:39,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:39,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1812441107, now seen corresponding path program 116 times [2018-09-26 08:22:39,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:40,111 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:40,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:22:40,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:22:40,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:22:40,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:22:40,113 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 119 states. [2018-09-26 08:22:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:41,088 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-26 08:22:41,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:22:41,088 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 118 [2018-09-26 08:22:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:41,089 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:22:41,089 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:22:41,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 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:22:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:22:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-09-26 08:22:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-09-26 08:22:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-09-26 08:22:41,095 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-09-26 08:22:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:41,095 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-09-26 08:22:41,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:22:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-09-26 08:22:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-26 08:22:41,096 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:41,096 INFO L375 BasicCegarLoop]: trace histogram [117, 1, 1] [2018-09-26 08:22:41,096 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:41,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:41,097 INFO L82 PathProgramCache]: Analyzing trace with hash 351099704, now seen corresponding path program 117 times [2018-09-26 08:22:41,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:41,807 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:41,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:22:41,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:22:41,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:22:41,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:22:41,809 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2018-09-26 08:22:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:42,776 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-09-26 08:22:42,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:22:42,776 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2018-09-26 08:22:42,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:42,777 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:22:42,777 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:22:42,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:22:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:22:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:22:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:22:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:22:42,785 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-09-26 08:22:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:42,785 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:22:42,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:22:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:22:42,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:22:42,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:42,786 INFO L375 BasicCegarLoop]: trace histogram [118, 1, 1] [2018-09-26 08:22:42,786 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:42,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:42,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2000810829, now seen corresponding path program 118 times [2018-09-26 08:22:42,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:43,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:43,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:22:43,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:22:43,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:22:43,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:22:43,552 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 121 states. [2018-09-26 08:22:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:44,554 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 08:22:44,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:22:44,554 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 120 [2018-09-26 08:22:44,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:44,554 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:22:44,554 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:22:44,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:22:44,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:22:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-09-26 08:22:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:22:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-26 08:22:44,562 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-09-26 08:22:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:44,563 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-26 08:22:44,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:22:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-26 08:22:44,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 08:22:44,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:44,564 INFO L375 BasicCegarLoop]: trace histogram [119, 1, 1] [2018-09-26 08:22:44,564 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:44,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:44,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1895593320, now seen corresponding path program 119 times [2018-09-26 08:22:44,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:45,375 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:22:45,375 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:45,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:22:45,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:22:45,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:22:45,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:22:45,377 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2018-09-26 08:22:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:46,385 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-09-26 08:22:46,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:22:46,385 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 121 [2018-09-26 08:22:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:46,386 INFO L225 Difference]: With dead ends: 124 [2018-09-26 08:22:46,386 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:22:46,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:22:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:22:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:22:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:22:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:22:46,392 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-09-26 08:22:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:46,392 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:22:46,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:22:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:22:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:22:46,393 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:46,393 INFO L375 BasicCegarLoop]: trace histogram [120, 1, 1] [2018-09-26 08:22:46,393 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:46,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:46,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1366149459, now seen corresponding path program 120 times [2018-09-26 08:22:46,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:47,214 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:47,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:22:47,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:22:47,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:22:47,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:22:47,215 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 123 states. [2018-09-26 08:22:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:48,203 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:22:48,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:22:48,203 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 122 [2018-09-26 08:22:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:48,204 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:22:48,204 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:22:48,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:22:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:22:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-09-26 08:22:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:22:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-09-26 08:22:48,213 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-09-26 08:22:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:48,214 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-09-26 08:22:48,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:22:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-09-26 08:22:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 08:22:48,215 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:48,215 INFO L375 BasicCegarLoop]: trace histogram [121, 1, 1] [2018-09-26 08:22:48,215 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:48,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:48,215 INFO L82 PathProgramCache]: Analyzing trace with hash -599039496, now seen corresponding path program 121 times [2018-09-26 08:22:48,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:49,226 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:49,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:22:49,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:22:49,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:22:49,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:22:49,227 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2018-09-26 08:22:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:50,250 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-26 08:22:50,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:22:50,250 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 123 [2018-09-26 08:22:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:50,250 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:22:50,250 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:22:50,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:22:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:22:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:22:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:22:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:22:50,258 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-09-26 08:22:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:50,258 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:22:50,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:22:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:22:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:22:50,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:50,259 INFO L375 BasicCegarLoop]: trace histogram [122, 1, 1] [2018-09-26 08:22:50,260 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:50,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:50,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1390354957, now seen corresponding path program 122 times [2018-09-26 08:22:50,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:51,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:51,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:22:51,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:22:51,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:22:51,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:22:51,052 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 125 states. [2018-09-26 08:22:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:52,116 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 08:22:52,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:22:52,116 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 124 [2018-09-26 08:22:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:52,117 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:22:52,117 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 08:22:52,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:22:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 08:22:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-09-26 08:22:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:22:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-26 08:22:52,125 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-09-26 08:22:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:52,126 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-26 08:22:52,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:22:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-26 08:22:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 08:22:52,126 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:52,127 INFO L375 BasicCegarLoop]: trace histogram [123, 1, 1] [2018-09-26 08:22:52,127 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:52,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:52,127 INFO L82 PathProgramCache]: Analyzing trace with hash -151330472, now seen corresponding path program 123 times [2018-09-26 08:22:52,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:52,927 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:52,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:22:52,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:22:52,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:22:52,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:22:52,928 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2018-09-26 08:22:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:54,007 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-09-26 08:22:54,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:22:54,008 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 125 [2018-09-26 08:22:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:54,008 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:22:54,008 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:22:54,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:22:54,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:22:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:22:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:22:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:22:54,014 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-09-26 08:22:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:54,014 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:22:54,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:22:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:22:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:22:54,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:54,014 INFO L375 BasicCegarLoop]: trace histogram [124, 1, 1] [2018-09-26 08:22:54,015 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:54,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:54,015 INFO L82 PathProgramCache]: Analyzing trace with hash -396277101, now seen corresponding path program 124 times [2018-09-26 08:22:54,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:54,814 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:54,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:22:54,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:22:54,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:22:54,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:22:54,815 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 127 states. [2018-09-26 08:22:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:55,907 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-09-26 08:22:55,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:22:55,907 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 126 [2018-09-26 08:22:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:55,908 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:22:55,908 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:22:55,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:22:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:22:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-09-26 08:22:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:22:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-09-26 08:22:55,916 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-09-26 08:22:55,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:55,917 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-09-26 08:22:55,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:22:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-09-26 08:22:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-26 08:22:55,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:55,918 INFO L375 BasicCegarLoop]: trace histogram [125, 1, 1] [2018-09-26 08:22:55,918 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:55,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:55,918 INFO L82 PathProgramCache]: Analyzing trace with hash 600311992, now seen corresponding path program 125 times [2018-09-26 08:22:55,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:56,723 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:56,724 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:22:56,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:22:56,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:22:56,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:22:56,725 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2018-09-26 08:22:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:57,848 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-26 08:22:57,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:22:57,848 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 127 [2018-09-26 08:22:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:57,849 INFO L225 Difference]: With dead ends: 130 [2018-09-26 08:22:57,849 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:22:57,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:22:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:22:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:22:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:22:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:22:57,858 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-09-26 08:22:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:57,859 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:22:57,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:22:57,859 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:22:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:22:57,860 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:57,860 INFO L375 BasicCegarLoop]: trace histogram [126, 1, 1] [2018-09-26 08:22:57,860 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:57,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:57,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1429802803, now seen corresponding path program 126 times [2018-09-26 08:22:57,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:58,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:58,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:22:58,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:22:58,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:22:58,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:22:58,724 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 129 states. [2018-09-26 08:22:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:59,838 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 08:22:59,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:22:59,839 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 128 [2018-09-26 08:22:59,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:59,839 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:22:59,839 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:22:59,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:22:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:22:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-09-26 08:22:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-26 08:22:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-09-26 08:22:59,848 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-09-26 08:22:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:59,848 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-09-26 08:22:59,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:22:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-09-26 08:22:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-26 08:22:59,849 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:59,849 INFO L375 BasicCegarLoop]: trace histogram [127, 1, 1] [2018-09-26 08:22:59,850 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:59,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:59,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1374214168, now seen corresponding path program 127 times [2018-09-26 08:22:59,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:00,688 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:00,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:23:00,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:23:00,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:23:00,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:23:00,690 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2018-09-26 08:23:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:01,874 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-09-26 08:23:01,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:23:01,875 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 129 [2018-09-26 08:23:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:01,875 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:23:01,876 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:23:01,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:23:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:23:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:23:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:23:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:23:01,883 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-09-26 08:23:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:01,883 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:23:01,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:23:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:23:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:23:01,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:01,884 INFO L375 BasicCegarLoop]: trace histogram [128, 1, 1] [2018-09-26 08:23:01,884 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:01,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash -349033517, now seen corresponding path program 128 times [2018-09-26 08:23:01,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:02,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:02,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:23:02,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:23:02,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:23:02,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:23:02,733 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 131 states. [2018-09-26 08:23:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:03,884 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-09-26 08:23:03,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:23:03,885 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 130 [2018-09-26 08:23:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:03,885 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:23:03,885 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:23:03,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:23:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:23:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-09-26 08:23:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 08:23:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-09-26 08:23:03,892 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-09-26 08:23:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:03,893 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-09-26 08:23:03,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:23:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-09-26 08:23:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 08:23:03,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:03,893 INFO L375 BasicCegarLoop]: trace histogram [129, 1, 1] [2018-09-26 08:23:03,894 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:03,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:03,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2064863096, now seen corresponding path program 129 times [2018-09-26 08:23:03,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:04,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:04,761 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:23:04,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:23:04,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:23:04,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:23:04,762 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2018-09-26 08:23:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:05,988 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-09-26 08:23:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:23:05,988 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 131 [2018-09-26 08:23:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:05,988 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:23:05,988 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:23:05,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:23:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:23:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:23:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:23:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:23:05,994 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-09-26 08:23:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:05,994 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:23:05,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:23:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:23:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:23:05,995 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:05,995 INFO L375 BasicCegarLoop]: trace histogram [130, 1, 1] [2018-09-26 08:23:05,995 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:05,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:05,995 INFO L82 PathProgramCache]: Analyzing trace with hash -413753229, now seen corresponding path program 130 times [2018-09-26 08:23:05,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:06,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:06,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:23:06,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:23:06,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:23:06,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:23:06,867 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 133 states. [2018-09-26 08:23:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:08,058 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:23:08,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:23:08,058 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 132 [2018-09-26 08:23:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:08,058 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:23:08,058 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:23:08,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:23:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:23:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-09-26 08:23:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:23:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-09-26 08:23:08,067 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-09-26 08:23:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:08,067 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-09-26 08:23:08,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:23:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-09-26 08:23:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-26 08:23:08,068 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:08,068 INFO L375 BasicCegarLoop]: trace histogram [131, 1, 1] [2018-09-26 08:23:08,068 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:08,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:08,069 INFO L82 PathProgramCache]: Analyzing trace with hash 58552024, now seen corresponding path program 131 times [2018-09-26 08:23:08,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:08,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:08,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:23:08,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:23:08,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:23:08,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:23:08,984 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2018-09-26 08:23:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:10,239 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-26 08:23:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:23:10,240 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 133 [2018-09-26 08:23:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:10,240 INFO L225 Difference]: With dead ends: 136 [2018-09-26 08:23:10,240 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:23:10,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:23:10,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:23:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:23:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:23:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:23:10,246 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-09-26 08:23:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:10,247 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:23:10,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:23:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:23:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:23:10,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:10,247 INFO L375 BasicCegarLoop]: trace histogram [132, 1, 1] [2018-09-26 08:23:10,248 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:10,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1815112979, now seen corresponding path program 132 times [2018-09-26 08:23:10,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:11,144 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:11,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:23:11,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:23:11,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:23:11,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:23:11,146 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 135 states. [2018-09-26 08:23:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:12,378 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-09-26 08:23:12,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:23:12,378 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 134 [2018-09-26 08:23:12,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:12,379 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:23:12,379 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:23:12,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:23:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:23:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-09-26 08:23:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:23:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-26 08:23:12,386 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-09-26 08:23:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:12,386 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-26 08:23:12,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:23:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-26 08:23:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 08:23:12,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:12,387 INFO L375 BasicCegarLoop]: trace histogram [133, 1, 1] [2018-09-26 08:23:12,387 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:12,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash 433927736, now seen corresponding path program 133 times [2018-09-26 08:23:12,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:13,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:13,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:23:13,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:23:13,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:23:13,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:23:13,329 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2018-09-26 08:23:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:14,608 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-09-26 08:23:14,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:23:14,609 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 135 [2018-09-26 08:23:14,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:14,609 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:23:14,609 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:23:14,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:23:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:23:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:23:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:23:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:23:14,617 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-09-26 08:23:14,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:14,618 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:23:14,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:23:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:23:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:23:14,618 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:14,618 INFO L375 BasicCegarLoop]: trace histogram [134, 1, 1] [2018-09-26 08:23:14,619 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:14,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash 566858163, now seen corresponding path program 134 times [2018-09-26 08:23:14,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:15,540 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:15,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:23:15,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:23:15,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:23:15,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:23:15,543 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 137 states. [2018-09-26 08:23:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:16,820 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 08:23:16,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:23:16,820 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 136 [2018-09-26 08:23:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:16,821 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:23:16,821 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 08:23:16,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:23:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 08:23:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-09-26 08:23:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:23:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-09-26 08:23:16,831 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-09-26 08:23:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:16,831 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-09-26 08:23:16,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:23:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-09-26 08:23:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-26 08:23:16,832 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:16,832 INFO L375 BasicCegarLoop]: trace histogram [135, 1, 1] [2018-09-26 08:23:16,833 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:16,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:16,833 INFO L82 PathProgramCache]: Analyzing trace with hash 392734104, now seen corresponding path program 135 times [2018-09-26 08:23:16,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:17,843 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:17,843 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:23:17,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:23:17,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:23:17,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:23:17,844 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2018-09-26 08:23:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:19,146 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 08:23:19,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:23:19,146 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 137 [2018-09-26 08:23:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:19,147 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:23:19,147 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:23:19,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:23:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:23:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:23:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:23:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:23:19,155 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-09-26 08:23:19,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:19,155 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:23:19,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:23:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:23:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:23:19,156 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:19,156 INFO L375 BasicCegarLoop]: trace histogram [136, 1, 1] [2018-09-26 08:23:19,156 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:19,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash -710144429, now seen corresponding path program 136 times [2018-09-26 08:23:19,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:20,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:20,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:23:20,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-09-26 08:23:20,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-09-26 08:23:20,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:23:20,104 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 139 states. [2018-09-26 08:23:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:21,413 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 08:23:21,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:23:21,414 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 138 [2018-09-26 08:23:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:21,414 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:23:21,414 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:23:21,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:23:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:23:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-09-26 08:23:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-09-26 08:23:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-09-26 08:23:21,421 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-09-26 08:23:21,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:21,421 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-09-26 08:23:21,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-09-26 08:23:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-09-26 08:23:21,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 08:23:21,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:21,422 INFO L375 BasicCegarLoop]: trace histogram [137, 1, 1] [2018-09-26 08:23:21,422 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:21,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:21,422 INFO L82 PathProgramCache]: Analyzing trace with hash -539640584, now seen corresponding path program 137 times [2018-09-26 08:23:21,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:22,439 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:22,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-09-26 08:23:22,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:23:22,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:23:22,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:23:22,441 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2018-09-26 08:23:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:23,735 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-09-26 08:23:23,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:23:23,736 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 139 [2018-09-26 08:23:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:23,736 INFO L225 Difference]: With dead ends: 142 [2018-09-26 08:23:23,736 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:23:23,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:23:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:23:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:23:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:23:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:23:23,742 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-09-26 08:23:23,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:23,742 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:23:23,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:23:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:23:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:23:23,743 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:23,743 INFO L375 BasicCegarLoop]: trace histogram [138, 1, 1] [2018-09-26 08:23:23,743 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:23,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:23,743 INFO L82 PathProgramCache]: Analyzing trace with hash 451011315, now seen corresponding path program 138 times [2018-09-26 08:23:23,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:24,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:24,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:23:24,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:23:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:23:24,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:23:24,716 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 141 states. [2018-09-26 08:23:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:26,071 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 08:23:26,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:23:26,071 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 140 [2018-09-26 08:23:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:26,071 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:23:26,071 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:23:26,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:23:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:23:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-09-26 08:23:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 08:23:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-09-26 08:23:26,078 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-09-26 08:23:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:26,079 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-09-26 08:23:26,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:23:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-09-26 08:23:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-26 08:23:26,079 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:26,079 INFO L375 BasicCegarLoop]: trace histogram [139, 1, 1] [2018-09-26 08:23:26,079 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:26,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1096449112, now seen corresponding path program 139 times [2018-09-26 08:23:26,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:27,106 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:27,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:23:27,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:23:27,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:23:27,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:23:27,108 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2018-09-26 08:23:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:28,450 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-09-26 08:23:28,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:23:28,450 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 141 [2018-09-26 08:23:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:28,451 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:23:28,451 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:23:28,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:23:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:23:28,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:23:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:23:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:23:28,457 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-09-26 08:23:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:28,458 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:23:28,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:23:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:23:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:23:28,458 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:28,458 INFO L375 BasicCegarLoop]: trace histogram [140, 1, 1] [2018-09-26 08:23:28,459 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:28,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:28,459 INFO L82 PathProgramCache]: Analyzing trace with hash -369815661, now seen corresponding path program 140 times [2018-09-26 08:23:28,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:29,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:29,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:23:29,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-26 08:23:29,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-26 08:23:29,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:23:29,480 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 143 states. [2018-09-26 08:23:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:30,871 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 08:23:30,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:23:30,871 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 142 [2018-09-26 08:23:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:30,898 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:23:30,898 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:23:30,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:23:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:23:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-09-26 08:23:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:23:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-09-26 08:23:30,908 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-09-26 08:23:30,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:30,909 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-09-26 08:23:30,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-26 08:23:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-09-26 08:23:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-26 08:23:30,909 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:30,909 INFO L375 BasicCegarLoop]: trace histogram [141, 1, 1] [2018-09-26 08:23:30,909 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:30,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:30,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1420616632, now seen corresponding path program 141 times [2018-09-26 08:23:30,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:31,922 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:31,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-09-26 08:23:31,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:23:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:23:31,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:23:31,924 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2018-09-26 08:23:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:33,313 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-26 08:23:33,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:23:33,313 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 143 [2018-09-26 08:23:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:33,314 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:23:33,314 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:23:33,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:23:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:23:33,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:23:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:23:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:23:33,321 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-09-26 08:23:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:33,322 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:23:33,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:23:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:23:33,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:23:33,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:33,322 INFO L375 BasicCegarLoop]: trace histogram [142, 1, 1] [2018-09-26 08:23:33,322 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:33,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1089442867, now seen corresponding path program 142 times [2018-09-26 08:23:33,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:34,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:34,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:23:34,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:23:34,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:23:34,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:23:34,643 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 145 states. [2018-09-26 08:23:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:36,080 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 08:23:36,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:23:36,080 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 144 [2018-09-26 08:23:36,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:36,080 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:23:36,080 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:23:36,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:23:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:23:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-09-26 08:23:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:23:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-26 08:23:36,086 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-09-26 08:23:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:36,087 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-26 08:23:36,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:23:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-26 08:23:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:23:36,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:36,087 INFO L375 BasicCegarLoop]: trace histogram [143, 1, 1] [2018-09-26 08:23:36,087 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:36,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:36,088 INFO L82 PathProgramCache]: Analyzing trace with hash -587009256, now seen corresponding path program 143 times [2018-09-26 08:23:36,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:37,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:37,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:23:37,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:23:37,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:23:37,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:23:37,141 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2018-09-26 08:23:38,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:38,596 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-09-26 08:23:38,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:23:38,596 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 145 [2018-09-26 08:23:38,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:38,596 INFO L225 Difference]: With dead ends: 148 [2018-09-26 08:23:38,596 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:23:38,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:23:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:23:38,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:23:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:23:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:23:38,604 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-09-26 08:23:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:38,604 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:23:38,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:23:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:23:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:23:38,604 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:38,604 INFO L375 BasicCegarLoop]: trace histogram [144, 1, 1] [2018-09-26 08:23:38,605 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:38,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:38,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1017417517, now seen corresponding path program 144 times [2018-09-26 08:23:38,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:39,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:39,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:23:39,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-09-26 08:23:39,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-09-26 08:23:39,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:23:39,701 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 147 states. [2018-09-26 08:23:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:41,145 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-09-26 08:23:41,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:23:41,146 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 146 [2018-09-26 08:23:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:41,146 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:23:41,146 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:23:41,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:23:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:23:41,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-09-26 08:23:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:23:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-09-26 08:23:41,153 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-09-26 08:23:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:41,153 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-09-26 08:23:41,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-09-26 08:23:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-09-26 08:23:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-26 08:23:41,154 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:41,154 INFO L375 BasicCegarLoop]: trace histogram [145, 1, 1] [2018-09-26 08:23:41,154 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:41,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:41,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1475171720, now seen corresponding path program 145 times [2018-09-26 08:23:41,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:42,244 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:42,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-09-26 08:23:42,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:23:42,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:23:42,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:23:42,246 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2018-09-26 08:23:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:43,753 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 08:23:43,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:23:43,754 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 147 [2018-09-26 08:23:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:43,754 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:23:43,754 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:23:43,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:23:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:23:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:23:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:23:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:23:43,760 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-09-26 08:23:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:43,761 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:23:43,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:23:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:23:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:23:43,761 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:43,761 INFO L375 BasicCegarLoop]: trace histogram [146, 1, 1] [2018-09-26 08:23:43,761 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:43,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:43,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1514317171, now seen corresponding path program 146 times [2018-09-26 08:23:43,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:44,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:44,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:23:44,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:23:44,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:23:44,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:23:44,859 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 149 states. [2018-09-26 08:23:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:46,371 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 08:23:46,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:23:46,371 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 148 [2018-09-26 08:23:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:46,371 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:23:46,371 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:23:46,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:23:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:23:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-09-26 08:23:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:23:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-09-26 08:23:46,381 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-09-26 08:23:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:46,381 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-09-26 08:23:46,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:23:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-09-26 08:23:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-26 08:23:46,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:46,382 INFO L375 BasicCegarLoop]: trace histogram [147, 1, 1] [2018-09-26 08:23:46,382 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:46,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:46,382 INFO L82 PathProgramCache]: Analyzing trace with hash -300807720, now seen corresponding path program 147 times [2018-09-26 08:23:46,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:47,560 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:47,560 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:23:47,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:23:47,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:23:47,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:23:47,562 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2018-09-26 08:23:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:49,068 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-09-26 08:23:49,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:23:49,068 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 149 [2018-09-26 08:23:49,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:49,069 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:23:49,069 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:23:49,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:23:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:23:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:23:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:23:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:23:49,078 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-09-26 08:23:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:49,079 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:23:49,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:23:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:23:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:23:49,079 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:49,079 INFO L375 BasicCegarLoop]: trace histogram [148, 1, 1] [2018-09-26 08:23:49,080 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:49,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:49,080 INFO L82 PathProgramCache]: Analyzing trace with hash -735104493, now seen corresponding path program 148 times [2018-09-26 08:23:49,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:50,061 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:50,062 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:23:50,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-26 08:23:50,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-26 08:23:50,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:23:50,064 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 151 states. [2018-09-26 08:23:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:51,619 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-09-26 08:23:51,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:23:51,619 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 150 [2018-09-26 08:23:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:51,620 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:23:51,620 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:23:51,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:23:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:23:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-09-26 08:23:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:23:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-26 08:23:51,630 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-09-26 08:23:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:51,630 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-26 08:23:51,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-26 08:23:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-26 08:23:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-26 08:23:51,631 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:51,631 INFO L375 BasicCegarLoop]: trace histogram [149, 1, 1] [2018-09-26 08:23:51,631 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:51,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:51,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1313402568, now seen corresponding path program 149 times [2018-09-26 08:23:51,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:52,882 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:52,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-09-26 08:23:52,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:23:52,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:23:52,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:23:52,884 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2018-09-26 08:23:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:54,454 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-09-26 08:23:54,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:23:54,455 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 151 [2018-09-26 08:23:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:54,455 INFO L225 Difference]: With dead ends: 154 [2018-09-26 08:23:54,455 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:23:54,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:23:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:23:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:23:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:23:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:23:54,463 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-09-26 08:23:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:54,463 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:23:54,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:23:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:23:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:23:54,463 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:54,464 INFO L375 BasicCegarLoop]: trace histogram [150, 1, 1] [2018-09-26 08:23:54,464 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:54,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:54,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2060773709, now seen corresponding path program 150 times [2018-09-26 08:23:54,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:55,675 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:55,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:23:55,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-09-26 08:23:55,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-09-26 08:23:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:23:55,677 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 153 states. [2018-09-26 08:23:57,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:57,245 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 08:23:57,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:23:57,245 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 152 [2018-09-26 08:23:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:57,245 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:23:57,246 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:23:57,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:23:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:23:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-09-26 08:23:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-09-26 08:23:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-09-26 08:23:57,252 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-09-26 08:23:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:57,252 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-09-26 08:23:57,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-09-26 08:23:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-09-26 08:23:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-26 08:23:57,253 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:57,253 INFO L375 BasicCegarLoop]: trace histogram [151, 1, 1] [2018-09-26 08:23:57,253 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:57,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:57,253 INFO L82 PathProgramCache]: Analyzing trace with hash 540524696, now seen corresponding path program 151 times [2018-09-26 08:23:57,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:58,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:58,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-09-26 08:23:58,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:23:58,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:23:58,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:23:58,436 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 154 states. [2018-09-26 08:24:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:00,078 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-26 08:24:00,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:24:00,078 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 153 [2018-09-26 08:24:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:00,078 INFO L225 Difference]: With dead ends: 156 [2018-09-26 08:24:00,078 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:24:00,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:24:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:24:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:24:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:24:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:24:00,085 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-09-26 08:24:00,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:00,085 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:24:00,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:24:00,085 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:24:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:24:00,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:00,086 INFO L375 BasicCegarLoop]: trace histogram [152, 1, 1] [2018-09-26 08:24:00,086 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:00,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash -423603373, now seen corresponding path program 152 times [2018-09-26 08:24:00,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:01,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:01,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:24:01,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-09-26 08:24:01,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-09-26 08:24:01,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:24:01,285 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 155 states. [2018-09-26 08:24:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:02,935 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-09-26 08:24:02,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:24:02,935 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 154 [2018-09-26 08:24:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:02,936 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:24:02,936 INFO L226 Difference]: Without dead ends: 156 [2018-09-26 08:24:02,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:24:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-09-26 08:24:02,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-09-26 08:24:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 08:24:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-26 08:24:02,944 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-09-26 08:24:02,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:02,944 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-26 08:24:02,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-09-26 08:24:02,944 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-26 08:24:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-26 08:24:02,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:02,945 INFO L375 BasicCegarLoop]: trace histogram [153, 1, 1] [2018-09-26 08:24:02,945 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:02,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:02,945 INFO L82 PathProgramCache]: Analyzing trace with hash -246802440, now seen corresponding path program 153 times [2018-09-26 08:24:02,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:04,208 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:04,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-09-26 08:24:04,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:24:04,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:24:04,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:24:04,210 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 156 states. [2018-09-26 08:24:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:05,836 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-09-26 08:24:05,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:24:05,836 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 155 [2018-09-26 08:24:05,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:05,836 INFO L225 Difference]: With dead ends: 158 [2018-09-26 08:24:05,836 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:24:05,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:24:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:24:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:24:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:24:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 08:24:05,846 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-09-26 08:24:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:05,846 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 08:24:05,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:24:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 08:24:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:24:05,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:05,847 INFO L375 BasicCegarLoop]: trace histogram [154, 1, 1] [2018-09-26 08:24:05,847 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:05,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash 939059187, now seen corresponding path program 154 times [2018-09-26 08:24:05,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:07,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:07,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:24:07,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-09-26 08:24:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-09-26 08:24:07,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:24:07,151 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 157 states. [2018-09-26 08:24:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:08,841 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 08:24:08,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:24:08,841 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 156 [2018-09-26 08:24:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:08,842 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:24:08,842 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:24:08,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:24:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:24:08,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-09-26 08:24:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 08:24:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-09-26 08:24:08,849 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-09-26 08:24:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:08,849 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-09-26 08:24:08,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-09-26 08:24:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-09-26 08:24:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-26 08:24:08,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:08,850 INFO L375 BasicCegarLoop]: trace histogram [155, 1, 1] [2018-09-26 08:24:08,850 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:08,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:08,850 INFO L82 PathProgramCache]: Analyzing trace with hash -953936040, now seen corresponding path program 155 times [2018-09-26 08:24:08,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:10,081 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:10,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-09-26 08:24:10,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-09-26 08:24:10,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-09-26 08:24:10,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:24:10,083 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 158 states. [2018-09-26 08:24:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:11,804 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-26 08:24:11,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:24:11,804 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 157 [2018-09-26 08:24:11,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:11,805 INFO L225 Difference]: With dead ends: 160 [2018-09-26 08:24:11,805 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:24:11,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:24:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:24:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:24:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:24:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-09-26 08:24:11,813 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-09-26 08:24:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:11,813 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-09-26 08:24:11,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-09-26 08:24:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-09-26 08:24:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:24:11,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:11,815 INFO L375 BasicCegarLoop]: trace histogram [156, 1, 1] [2018-09-26 08:24:11,815 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:11,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash 492754067, now seen corresponding path program 156 times [2018-09-26 08:24:11,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:13,126 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:13,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-09-26 08:24:13,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-09-26 08:24:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-09-26 08:24:13,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:24:13,128 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 159 states. [2018-09-26 08:24:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:14,831 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-26 08:24:14,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:24:14,831 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 158 [2018-09-26 08:24:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:14,832 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:24:14,832 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 08:24:14,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:24:14,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 08:24:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-09-26 08:24:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-26 08:24:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-09-26 08:24:14,841 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-09-26 08:24:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:14,842 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-09-26 08:24:14,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-09-26 08:24:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-09-26 08:24:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-26 08:24:14,842 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:14,842 INFO L375 BasicCegarLoop]: trace histogram [157, 1, 1] [2018-09-26 08:24:14,842 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:14,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:14,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1904492872, now seen corresponding path program 157 times [2018-09-26 08:24:14,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:16,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:16,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-09-26 08:24:16,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:24:16,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:24:16,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:24:16,114 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 160 states. [2018-09-26 08:24:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:17,836 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-09-26 08:24:17,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:24:17,836 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 159 [2018-09-26 08:24:17,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:17,836 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:24:17,836 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:24:17,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:24:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:24:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:24:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:24:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:24:17,844 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-09-26 08:24:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:17,844 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:24:17,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:24:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:24:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:24:17,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:17,845 INFO L375 BasicCegarLoop]: trace histogram [158, 1, 1] [2018-09-26 08:24:17,845 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:17,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:17,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1090263347, now seen corresponding path program 158 times [2018-09-26 08:24:17,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:19,138 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:19,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:24:19,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-09-26 08:24:19,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-09-26 08:24:19,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:24:19,140 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 161 states. [2018-09-26 08:24:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:20,928 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-26 08:24:20,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:24:20,928 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 160 [2018-09-26 08:24:20,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:20,929 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:24:20,929 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 08:24:20,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:24:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 08:24:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-26 08:24:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 08:24:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-09-26 08:24:20,935 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-09-26 08:24:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:20,936 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-09-26 08:24:20,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-09-26 08:24:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-09-26 08:24:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-26 08:24:20,936 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:20,936 INFO L375 BasicCegarLoop]: trace histogram [159, 1, 1] [2018-09-26 08:24:20,936 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:20,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:20,937 INFO L82 PathProgramCache]: Analyzing trace with hash -561574376, now seen corresponding path program 159 times [2018-09-26 08:24:20,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:22,240 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:22,240 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-09-26 08:24:22,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-09-26 08:24:22,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-09-26 08:24:22,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:24:22,242 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 162 states. [2018-09-26 08:24:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:24,051 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-09-26 08:24:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:24:24,051 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 161 [2018-09-26 08:24:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:24,052 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:24:24,052 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:24:24,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:24:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:24:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:24:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:24:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-09-26 08:24:24,061 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-09-26 08:24:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:24,061 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-09-26 08:24:24,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-09-26 08:24:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-09-26 08:24:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:24:24,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:24,061 INFO L375 BasicCegarLoop]: trace histogram [160, 1, 1] [2018-09-26 08:24:24,062 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:24,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash -228936237, now seen corresponding path program 160 times [2018-09-26 08:24:24,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:25,412 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:25,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-09-26 08:24:25,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-09-26 08:24:25,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-09-26 08:24:25,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:24:25,414 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 163 states. [2018-09-26 08:24:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:27,209 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-26 08:24:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:24:27,209 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 162 [2018-09-26 08:24:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:27,210 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:24:27,210 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:24:27,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:24:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:24:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-09-26 08:24:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-26 08:24:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-09-26 08:24:27,220 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-09-26 08:24:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:27,221 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-09-26 08:24:27,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-09-26 08:24:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-09-26 08:24:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-26 08:24:27,222 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:27,222 INFO L375 BasicCegarLoop]: trace histogram [161, 1, 1] [2018-09-26 08:24:27,222 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:27,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1492911480, now seen corresponding path program 161 times [2018-09-26 08:24:27,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:28,594 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:28,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-09-26 08:24:28,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:24:28,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:24:28,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:24:28,596 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 164 states. [2018-09-26 08:24:30,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:30,394 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-09-26 08:24:30,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:24:30,394 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 163 [2018-09-26 08:24:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:30,395 INFO L225 Difference]: With dead ends: 166 [2018-09-26 08:24:30,395 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:24:30,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:24:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:24:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:24:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:24:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 08:24:30,404 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-09-26 08:24:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:30,405 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 08:24:30,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:24:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 08:24:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:24:30,406 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:30,406 INFO L375 BasicCegarLoop]: trace histogram [162, 1, 1] [2018-09-26 08:24:30,406 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:30,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:30,406 INFO L82 PathProgramCache]: Analyzing trace with hash -964384141, now seen corresponding path program 162 times [2018-09-26 08:24:30,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:31,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:31,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:24:31,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-09-26 08:24:31,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-09-26 08:24:31,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:24:31,938 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 165 states. [2018-09-26 08:24:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:33,800 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-26 08:24:33,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:24:33,800 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 164 [2018-09-26 08:24:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:33,801 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:24:33,801 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 08:24:33,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:24:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 08:24:33,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-26 08:24:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:24:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-26 08:24:33,808 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-09-26 08:24:33,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:33,808 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-26 08:24:33,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-09-26 08:24:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-26 08:24:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-26 08:24:33,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:33,809 INFO L375 BasicCegarLoop]: trace histogram [163, 1, 1] [2018-09-26 08:24:33,809 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:33,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:33,809 INFO L82 PathProgramCache]: Analyzing trace with hash 168862936, now seen corresponding path program 163 times [2018-09-26 08:24:33,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:35,177 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:35,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-09-26 08:24:35,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-09-26 08:24:35,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-09-26 08:24:35,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:24:35,179 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 166 states. [2018-09-26 08:24:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:37,071 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-09-26 08:24:37,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:24:37,071 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 165 [2018-09-26 08:24:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:37,071 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:24:37,071 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:24:37,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:24:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:24:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:24:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:24:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:24:37,078 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-09-26 08:24:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:37,079 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:24:37,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-09-26 08:24:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:24:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:24:37,079 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:37,079 INFO L375 BasicCegarLoop]: trace histogram [164, 1, 1] [2018-09-26 08:24:37,079 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:37,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:37,080 INFO L82 PathProgramCache]: Analyzing trace with hash 939783955, now seen corresponding path program 164 times [2018-09-26 08:24:37,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:38,480 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:38,480 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-09-26 08:24:38,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-09-26 08:24:38,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-09-26 08:24:38,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:24:38,482 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 167 states. [2018-09-26 08:24:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:40,403 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-09-26 08:24:40,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:24:40,403 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 166 [2018-09-26 08:24:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:40,404 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:24:40,404 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 08:24:40,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:24:40,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 08:24:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-09-26 08:24:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 08:24:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-09-26 08:24:40,412 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-09-26 08:24:40,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:40,412 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-09-26 08:24:40,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-09-26 08:24:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-09-26 08:24:40,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-26 08:24:40,413 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:40,413 INFO L375 BasicCegarLoop]: trace histogram [165, 1, 1] [2018-09-26 08:24:40,413 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:40,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:40,414 INFO L82 PathProgramCache]: Analyzing trace with hash -931468232, now seen corresponding path program 165 times [2018-09-26 08:24:40,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:41,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-09-26 08:24:41,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:24:41,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:24:41,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:24:41,931 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 168 states. [2018-09-26 08:24:43,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,879 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-26 08:24:43,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:24:43,879 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 167 [2018-09-26 08:24:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,880 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:24:43,880 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:24:43,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:24:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:24:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:24:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:24:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 08:24:43,892 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-09-26 08:24:43,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,893 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 08:24:43,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-09-26 08:24:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 08:24:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:24:43,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,894 INFO L375 BasicCegarLoop]: trace histogram [166, 1, 1] [2018-09-26 08:24:43,894 INFO L423 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1189256115, now seen corresponding path program 166 times [2018-09-26 08:24:43,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,455 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:24:45,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-09-26 08:24:45,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-09-26 08:24:45,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:24:45,457 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 169 states. [2018-09-26 08:24:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,392 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 08:24:47,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:24:47,392 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 168 [2018-09-26 08:24:47,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,393 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:24:47,393 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:24:47,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:24:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:24:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-09-26 08:24:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-09-26 08:24:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-09-26 08:24:47,404 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-09-26 08:24:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:47,404 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-09-26 08:24:47,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-09-26 08:24:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-09-26 08:24:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-26 08:24:47,405 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:47,405 INFO L375 BasicCegarLoop]: trace histogram [167, 1, 1] [2018-09-26 08:24:47,405 INFO L423 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:47,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:47,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1787765864, now seen corresponding path program 167 times [2018-09-26 08:24:47,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-09-26 08:24:48,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-09-26 08:24:48,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-09-26 08:24:48,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:24:48,961 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 170 states. [2018-09-26 08:24:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:50,909 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-09-26 08:24:50,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:24:50,909 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 169 [2018-09-26 08:24:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:50,910 INFO L225 Difference]: With dead ends: 172 [2018-09-26 08:24:50,910 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:24:50,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:24:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:24:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:24:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:24:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 08:24:50,921 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-09-26 08:24:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:50,921 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 08:24:50,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-09-26 08:24:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 08:24:50,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:24:50,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:50,922 INFO L375 BasicCegarLoop]: trace histogram [168, 1, 1] [2018-09-26 08:24:50,922 INFO L423 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:50,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:50,923 INFO L82 PathProgramCache]: Analyzing trace with hash 413833299, now seen corresponding path program 168 times [2018-09-26 08:24:50,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:52,486 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:52,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-09-26 08:24:52,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-09-26 08:24:52,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-09-26 08:24:52,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:24:52,489 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 171 states. [2018-09-26 08:24:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:54,519 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-09-26 08:24:54,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:24:54,519 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 170 [2018-09-26 08:24:54,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:54,519 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:24:54,520 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 08:24:54,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:24:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 08:24:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-09-26 08:24:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-26 08:24:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-09-26 08:24:54,527 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-09-26 08:24:54,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:54,527 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-09-26 08:24:54,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-09-26 08:24:54,527 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-09-26 08:24:54,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-26 08:24:54,527 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:54,528 INFO L375 BasicCegarLoop]: trace histogram [169, 1, 1] [2018-09-26 08:24:54,528 INFO L423 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:54,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:54,528 INFO L82 PathProgramCache]: Analyzing trace with hash -56069384, now seen corresponding path program 169 times [2018-09-26 08:24:54,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:56,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:56,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-09-26 08:24:56,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-09-26 08:24:56,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-09-26 08:24:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:24:56,040 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 172 states. [2018-09-26 08:24:58,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:58,112 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-09-26 08:24:58,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:24:58,112 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 171 [2018-09-26 08:24:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:58,113 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:24:58,113 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:24:58,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:24:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:24:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:24:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:24:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:24:58,120 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-09-26 08:24:58,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:58,120 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:24:58,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-09-26 08:24:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:24:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:24:58,121 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:58,121 INFO L375 BasicCegarLoop]: trace histogram [170, 1, 1] [2018-09-26 08:24:58,121 INFO L423 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:58,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:58,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1738150669, now seen corresponding path program 170 times [2018-09-26 08:24:58,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:59,657 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:59,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-09-26 08:24:59,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-09-26 08:24:59,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-09-26 08:24:59,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:24:59,661 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 173 states. [2018-09-26 08:25:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:01,754 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 08:25:01,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:25:01,754 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 172 [2018-09-26 08:25:01,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:01,755 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:25:01,755 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 08:25:01,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:25:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 08:25:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-09-26 08:25:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 08:25:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-09-26 08:25:01,762 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-09-26 08:25:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:01,763 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-09-26 08:25:01,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-09-26 08:25:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-09-26 08:25:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-26 08:25:01,763 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:01,763 INFO L375 BasicCegarLoop]: trace histogram [171, 1, 1] [2018-09-26 08:25:01,764 INFO L423 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:01,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:01,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1951904344, now seen corresponding path program 171 times [2018-09-26 08:25:01,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:03,321 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:03,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-09-26 08:25:03,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-09-26 08:25:03,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-09-26 08:25:03,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:25:03,324 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 174 states. [2018-09-26 08:25:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:05,411 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-26 08:25:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:25:05,412 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 173 [2018-09-26 08:25:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:05,412 INFO L225 Difference]: With dead ends: 176 [2018-09-26 08:25:05,412 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:25:05,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:25:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:25:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:25:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:25:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-09-26 08:25:05,421 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-09-26 08:25:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:05,421 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-09-26 08:25:05,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-09-26 08:25:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-09-26 08:25:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:25:05,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:05,422 INFO L375 BasicCegarLoop]: trace histogram [172, 1, 1] [2018-09-26 08:25:05,422 INFO L423 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:05,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:05,422 INFO L82 PathProgramCache]: Analyzing trace with hash 379492755, now seen corresponding path program 172 times [2018-09-26 08:25:05,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:07,090 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:07,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-09-26 08:25:07,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-09-26 08:25:07,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-09-26 08:25:07,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:25:07,093 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 175 states. [2018-09-26 08:25:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:09,273 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-09-26 08:25:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-26 08:25:09,274 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 174 [2018-09-26 08:25:09,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:09,274 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:25:09,274 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:25:09,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:25:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:25:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-09-26 08:25:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 08:25:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-26 08:25:09,285 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-09-26 08:25:09,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:09,286 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-26 08:25:09,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-09-26 08:25:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-26 08:25:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-26 08:25:09,287 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:09,287 INFO L375 BasicCegarLoop]: trace histogram [173, 1, 1] [2018-09-26 08:25:09,287 INFO L423 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:09,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:09,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1120626248, now seen corresponding path program 173 times [2018-09-26 08:25:09,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:10,978 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:10,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-09-26 08:25:10,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-09-26 08:25:10,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-09-26 08:25:10,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:25:10,980 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 176 states. [2018-09-26 08:25:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:13,118 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-09-26 08:25:13,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:25:13,118 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 175 [2018-09-26 08:25:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:13,119 INFO L225 Difference]: With dead ends: 178 [2018-09-26 08:25:13,119 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:25:13,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:25:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:25:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:25:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:25:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 08:25:13,128 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-09-26 08:25:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:13,128 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 08:25:13,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-09-26 08:25:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 08:25:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:25:13,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:13,129 INFO L375 BasicCegarLoop]: trace histogram [174, 1, 1] [2018-09-26 08:25:13,129 INFO L423 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:13,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash -379675085, now seen corresponding path program 174 times [2018-09-26 08:25:13,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,826 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-09-26 08:25:14,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-09-26 08:25:14,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-09-26 08:25:14,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:25:14,828 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 177 states. [2018-09-26 08:25:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:16,966 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-26 08:25:16,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-09-26 08:25:16,966 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 176 [2018-09-26 08:25:16,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:16,966 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:25:16,966 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 08:25:16,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:25:16,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 08:25:16,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-09-26 08:25:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-09-26 08:25:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-09-26 08:25:16,976 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2018-09-26 08:25:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:16,976 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-09-26 08:25:16,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-09-26 08:25:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-09-26 08:25:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-26 08:25:16,977 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:16,977 INFO L375 BasicCegarLoop]: trace histogram [175, 1, 1] [2018-09-26 08:25:16,978 INFO L423 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:16,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:16,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1114974488, now seen corresponding path program 175 times [2018-09-26 08:25:16,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:18,688 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:18,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-09-26 08:25:18,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-09-26 08:25:18,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-09-26 08:25:18,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:25:18,690 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 178 states. [2018-09-26 08:25:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:20,856 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-26 08:25:20,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-09-26 08:25:20,856 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 177 [2018-09-26 08:25:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:20,857 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:25:20,857 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:25:20,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:25:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:25:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:25:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:25:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-09-26 08:25:20,865 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2018-09-26 08:25:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:20,865 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-09-26 08:25:20,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-09-26 08:25:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-09-26 08:25:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:25:20,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:20,866 INFO L375 BasicCegarLoop]: trace histogram [176, 1, 1] [2018-09-26 08:25:20,866 INFO L423 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:20,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash 204470995, now seen corresponding path program 176 times [2018-09-26 08:25:20,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:22,593 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:22,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-09-26 08:25:22,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-09-26 08:25:22,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-09-26 08:25:22,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=31507, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:25:22,595 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 179 states. [2018-09-26 08:25:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:24,787 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-09-26 08:25:24,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:25:24,787 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 178 [2018-09-26 08:25:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:24,788 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:25:24,788 INFO L226 Difference]: Without dead ends: 180 [2018-09-26 08:25:24,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=355, Invalid=31507, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:25:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-26 08:25:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-09-26 08:25:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-09-26 08:25:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-09-26 08:25:24,796 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 178 [2018-09-26 08:25:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:24,796 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-09-26 08:25:24,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-09-26 08:25:24,796 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-09-26 08:25:24,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-26 08:25:24,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:24,797 INFO L375 BasicCegarLoop]: trace histogram [177, 1, 1] [2018-09-26 08:25:24,797 INFO L423 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:24,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:24,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2043633784, now seen corresponding path program 177 times [2018-09-26 08:25:24,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:26,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:26,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-09-26 08:25:26,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-09-26 08:25:26,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-09-26 08:25:26,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=31863, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:25:26,584 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 180 states. [2018-09-26 08:25:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:28,799 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-09-26 08:25:28,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-09-26 08:25:28,799 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 179 [2018-09-26 08:25:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:28,800 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:25:28,800 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:25:28,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=357, Invalid=31863, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:25:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:25:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:25:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:25:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 08:25:28,812 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 179 [2018-09-26 08:25:28,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:28,812 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 08:25:28,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-09-26 08:25:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 08:25:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:25:28,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:28,813 INFO L375 BasicCegarLoop]: trace histogram [178, 1, 1] [2018-09-26 08:25:28,813 INFO L423 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:28,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:28,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1071861901, now seen corresponding path program 178 times [2018-09-26 08:25:28,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:30,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:30,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-09-26 08:25:30,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-09-26 08:25:30,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-09-26 08:25:30,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=32221, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:25:30,718 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 181 states. [2018-09-26 08:25:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:32,866 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-26 08:25:32,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-09-26 08:25:32,866 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 180 [2018-09-26 08:25:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:32,866 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:25:32,867 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 08:25:32,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=359, Invalid=32221, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:25:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 08:25:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-26 08:25:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 08:25:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-09-26 08:25:32,874 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 180 [2018-09-26 08:25:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:32,875 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-09-26 08:25:32,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-09-26 08:25:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-09-26 08:25:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-26 08:25:32,875 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:32,875 INFO L375 BasicCegarLoop]: trace histogram [179, 1, 1] [2018-09-26 08:25:32,876 INFO L423 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:32,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1132019672, now seen corresponding path program 179 times [2018-09-26 08:25:32,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:34,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:34,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-09-26 08:25:34,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-09-26 08:25:34,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-09-26 08:25:34,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=32581, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:25:34,787 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 182 states. [2018-09-26 08:25:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:37,050 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-09-26 08:25:37,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-09-26 08:25:37,051 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 181 [2018-09-26 08:25:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:37,051 INFO L225 Difference]: With dead ends: 184 [2018-09-26 08:25:37,051 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:25:37,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=361, Invalid=32581, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:25:37,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:25:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:25:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:25:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-09-26 08:25:37,059 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 181 [2018-09-26 08:25:37,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:37,059 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-09-26 08:25:37,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-09-26 08:25:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-09-26 08:25:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:25:37,060 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:37,060 INFO L375 BasicCegarLoop]: trace histogram [180, 1, 1] [2018-09-26 08:25:37,060 INFO L423 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:37,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:37,061 INFO L82 PathProgramCache]: Analyzing trace with hash 732871699, now seen corresponding path program 180 times [2018-09-26 08:25:37,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:38,880 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:38,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-09-26 08:25:38,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-09-26 08:25:38,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-09-26 08:25:38,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=32943, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:25:38,881 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 183 states. [2018-09-26 08:25:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:41,164 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-26 08:25:41,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-09-26 08:25:41,165 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 182 [2018-09-26 08:25:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:41,165 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:25:41,165 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:25:41,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=363, Invalid=32943, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:25:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:25:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-09-26 08:25:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:25:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-09-26 08:25:41,173 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 182 [2018-09-26 08:25:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:41,173 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-09-26 08:25:41,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-09-26 08:25:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-09-26 08:25:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-26 08:25:41,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:41,174 INFO L375 BasicCegarLoop]: trace histogram [181, 1, 1] [2018-09-26 08:25:41,174 INFO L423 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:41,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:41,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1244186424, now seen corresponding path program 181 times [2018-09-26 08:25:41,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:25:41,284 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.interpolate(Interpolator.java:215) 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:25:41,288 INFO L168 Benchmark]: Toolchain (without parser) took 243846.62 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -468.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-09-26 08:25:41,289 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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:25:41,289 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.27 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:25:41,290 INFO L168 Benchmark]: Boogie Preprocessor took 22.78 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:25:41,290 INFO L168 Benchmark]: RCFGBuilder took 283.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:25:41,291 INFO L168 Benchmark]: TraceAbstraction took 243490.56 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -479.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-09-26 08:25:41,294 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.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 Procedure Inliner took 43.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.78 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 283.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243490.56 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -479.4 MB). Peak memory consumption was 1.5 GB. 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.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEqualityWithBranches.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-25-41-304.csv Completed graceful shutdown