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/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:11:45,240 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:11:45,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:11:45,261 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:11:45,262 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:11:45,263 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:11:45,265 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:11:45,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:11:45,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:11:45,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:11:45,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:11:45,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:11:45,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:11:45,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:11:45,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:11:45,291 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:11:45,295 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:11:45,302 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:11:45,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:11:45,309 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:11:45,311 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:11:45,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:11:45,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:11:45,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:11:45,316 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:11:45,318 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:11:45,319 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:11:45,320 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:11:45,321 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:11:45,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:11:45,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:11:45,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:11:45,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:11:45,326 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:11:45,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:11:45,330 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:11:45,331 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:11:45,344 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:11:45,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:11:45,346 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:11:45,347 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:11:45,347 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:11:45,347 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:11:45,347 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:11:45,348 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:11:45,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:11:45,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:11:45,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:11:45,442 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:11:45,442 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:11:45,443 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2018-09-26 08:11:45,444 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2018-09-26 08:11:45,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:11:45,526 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:11:45,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:11:45,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:11:45,528 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:11:45,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:45" (1/1) ... [2018-09-26 08:11:45,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:45" (1/1) ... [2018-09-26 08:11:45,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:11:45,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:11:45,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:11:45,577 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:11:45,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:45" (1/1) ... [2018-09-26 08:11:45,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:45" (1/1) ... [2018-09-26 08:11:45,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:45" (1/1) ... [2018-09-26 08:11:45,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:45" (1/1) ... [2018-09-26 08:11:45,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:45" (1/1) ... [2018-09-26 08:11:45,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:45" (1/1) ... [2018-09-26 08:11:45,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:45" (1/1) ... [2018-09-26 08:11:45,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:11:45,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:11:45,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:11:45,602 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:11:45,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:45" (1/1) ... [2018-09-26 08:11:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:11:45,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:11:45,882 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:11:45,883 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:11:45 BoogieIcfgContainer [2018-09-26 08:11:45,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:11:45,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:11:45,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:11:45,890 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:11:45,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:45" (1/2) ... [2018-09-26 08:11:45,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6f8ca9 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:11:45, skipping insertion in model container [2018-09-26 08:11:45,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:11:45" (2/2) ... [2018-09-26 08:11:45,896 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2018-09-26 08:11:45,908 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:11:45,919 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:11:45,980 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:11:45,981 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:11:45,981 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:11:45,981 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:11:45,981 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:11:45,982 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:11:45,982 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:11:45,982 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:11:45,982 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:11:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-26 08:11:46,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:11:46,019 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:46,021 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:11:46,022 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:46,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:46,030 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-09-26 08:11:46,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,095 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:11:46,099 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:11:46,099 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:11:46,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:11:46,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:11:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:11:46,123 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-09-26 08:11:46,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,165 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2018-09-26 08:11:46,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:11:46,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-09-26 08:11:46,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,181 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:11:46,182 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:11:46,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:11:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:11:46,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:11:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:11:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-26 08:11:46,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2018-09-26 08:11:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:46,240 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-26 08:11:46,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:11:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-26 08:11:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:11:46,241 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:46,241 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:11:46,242 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:46,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:46,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-09-26 08:11:46,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 08:11:46,280 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:11:46,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:11:46,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:11:46,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:11:46,284 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-09-26 08:11:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,327 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-09-26 08:11:46,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:11:46,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-09-26 08:11:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,329 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:11:46,329 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:11:46,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:11:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:11:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:11:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:11:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-26 08:11:46,335 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-09-26 08:11:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:46,336 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-26 08:11:46,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:11:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-26 08:11:46,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:11:46,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:46,337 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-09-26 08:11:46,337 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:46,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:46,338 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 2 times [2018-09-26 08:11:46,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-26 08:11:46,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:11:46,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:11:46,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:11:46,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:11:46,392 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-09-26 08:11:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,429 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-09-26 08:11:46,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:11:46,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-09-26 08:11:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,431 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:11:46,431 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:11:46,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:11:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:11:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:11:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:11:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-26 08:11:46,439 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-09-26 08:11:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:46,439 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-26 08:11:46,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:11:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-26 08:11:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:11:46,441 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:46,441 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-09-26 08:11:46,441 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:46,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 3 times [2018-09-26 08:11:46,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,505 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-26 08:11:46,505 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:11:46,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:11:46,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:11:46,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:11:46,507 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-09-26 08:11:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,552 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-09-26 08:11:46,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:11:46,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-09-26 08:11:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,553 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:11:46,553 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:11:46,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:11:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:11:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:11:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:11:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-26 08:11:46,561 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-09-26 08:11:46,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:46,562 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-26 08:11:46,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:11:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-26 08:11:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:11:46,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:46,563 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-09-26 08:11:46,563 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:46,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:46,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 4 times [2018-09-26 08:11:46,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-09-26 08:11:46,617 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:11:46,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:11:46,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:11:46,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:11:46,622 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2018-09-26 08:11:46,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,684 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-09-26 08:11:46,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:11:46,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-09-26 08:11:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,686 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:11:46,686 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:11:46,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:11:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:11:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:11:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:11:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-26 08:11:46,694 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-09-26 08:11:46,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:46,694 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-26 08:11:46,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:11:46,695 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-26 08:11:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:11:46,696 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:46,696 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-09-26 08:11:46,696 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:46,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:46,697 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 5 times [2018-09-26 08:11:46,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-26 08:11:46,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,778 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:11:46,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:11:46,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:11:46,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:11:46,779 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-09-26 08:11:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,836 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-09-26 08:11:46,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:11:46,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-09-26 08:11:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,837 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:11:46,838 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:11:46,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:11:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:11:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:11:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:11:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-26 08:11:46,846 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2018-09-26 08:11:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:46,846 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-26 08:11:46,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:11:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-26 08:11:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:11:46,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:46,848 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-09-26 08:11:46,848 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:46,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:46,849 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 6 times [2018-09-26 08:11:46,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-26 08:11:46,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:11:46,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:11:46,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:11:46,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:11:46,933 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2018-09-26 08:11:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,994 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-09-26 08:11:46,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:11:46,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-09-26 08:11:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,996 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:11:46,996 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:11:46,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:11:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:11:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:11:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:11:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-26 08:11:47,005 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-09-26 08:11:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:47,005 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-26 08:11:47,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:11:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-26 08:11:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:11:47,007 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:47,007 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-09-26 08:11:47,007 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:47,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:47,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 7 times [2018-09-26 08:11:47,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-09-26 08:11:47,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:47,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:11:47,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:11:47,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:11:47,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:11:47,083 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states. [2018-09-26 08:11:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:47,121 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-09-26 08:11:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:11:47,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-09-26 08:11:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:47,124 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:11:47,124 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:11:47,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:11:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:11:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:11:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:11:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-26 08:11:47,133 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-09-26 08:11:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:47,133 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-26 08:11:47,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:11:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-26 08:11:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:11:47,135 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:47,135 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-09-26 08:11:47,137 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:47,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:47,137 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 8 times [2018-09-26 08:11:47,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-26 08:11:47,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:47,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:11:47,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:11:47,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:11:47,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:11:47,218 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-09-26 08:11:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:47,282 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-09-26 08:11:47,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:11:47,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-09-26 08:11:47,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:47,287 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:11:47,287 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:11:47,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:11:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:11:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:11:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:11:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-26 08:11:47,305 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2018-09-26 08:11:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:47,305 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-26 08:11:47,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:11:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-26 08:11:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:11:47,310 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:47,311 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-09-26 08:11:47,311 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:47,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:47,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 9 times [2018-09-26 08:11:47,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-09-26 08:11:47,409 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:47,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:11:47,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:11:47,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:11:47,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:11:47,411 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 12 states. [2018-09-26 08:11:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:47,472 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-09-26 08:11:47,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:11:47,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-09-26 08:11:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:47,474 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:11:47,474 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:11:47,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:11:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:11:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:11:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:11:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-26 08:11:47,488 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2018-09-26 08:11:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:47,489 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-26 08:11:47,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:11:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-26 08:11:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:11:47,491 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:47,491 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-09-26 08:11:47,492 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:47,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:47,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 10 times [2018-09-26 08:11:47,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:11:47,568 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:47,568 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:11:47,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:11:47,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:11:47,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:11:47,569 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 13 states. [2018-09-26 08:11:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:47,600 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-09-26 08:11:47,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:11:47,600 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-09-26 08:11:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:47,601 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:11:47,601 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:11:47,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:11:47,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:11:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:11:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:11:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-26 08:11:47,612 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-09-26 08:11:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:47,612 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-26 08:11:47,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:11:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-26 08:11:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:11:47,615 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:47,615 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-09-26 08:11:47,616 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:47,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:47,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 11 times [2018-09-26 08:11:47,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-09-26 08:11:47,698 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:47,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:11:47,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:11:47,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:11:47,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:11:47,701 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 14 states. [2018-09-26 08:11:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:47,752 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-09-26 08:11:47,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:11:47,753 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-09-26 08:11:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:47,754 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:11:47,754 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:11:47,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:11:47,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:11:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:11:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:11:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-26 08:11:47,770 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-09-26 08:11:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:47,770 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-26 08:11:47,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:11:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-26 08:11:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:11:47,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:47,772 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-09-26 08:11:47,772 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:47,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:47,773 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 12 times [2018-09-26 08:11:47,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-09-26 08:11:47,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:47,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:11:47,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:11:47,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:11:47,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:11:47,861 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 15 states. [2018-09-26 08:11:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:47,912 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-09-26 08:11:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:11:47,913 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-09-26 08:11:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:47,914 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:11:47,914 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:11:47,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:11:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:11:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:11:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:11:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-26 08:11:47,924 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-09-26 08:11:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:47,924 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-26 08:11:47,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:11:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-26 08:11:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:11:47,926 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:47,926 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-09-26 08:11:47,926 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:47,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:47,927 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 13 times [2018-09-26 08:11:47,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-09-26 08:11:48,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:48,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:11:48,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:11:48,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:11:48,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:11:48,035 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 16 states. [2018-09-26 08:11:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,075 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-09-26 08:11:48,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:11:48,075 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-09-26 08:11:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,076 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:11:48,076 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:11:48,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:11:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:11:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:11:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:11:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-26 08:11:48,096 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2018-09-26 08:11:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,096 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-26 08:11:48,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:11:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-26 08:11:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:11:48,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,099 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-09-26 08:11:48,100 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 14 times [2018-09-26 08:11:48,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-09-26 08:11:48,181 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:48,181 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:11:48,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:11:48,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:11:48,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:11:48,183 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 17 states. [2018-09-26 08:11:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,223 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-09-26 08:11:48,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:11:48,224 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2018-09-26 08:11:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,225 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:11:48,225 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:11:48,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:11:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:11:48,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:11:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:11:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-26 08:11:48,240 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-09-26 08:11:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,240 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-26 08:11:48,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:11:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-26 08:11:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:11:48,242 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,247 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-09-26 08:11:48,248 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 15 times [2018-09-26 08:11:48,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-26 08:11:48,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:48,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:11:48,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:11:48,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:11:48,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:11:48,352 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 18 states. [2018-09-26 08:11:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,395 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-09-26 08:11:48,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:11:48,395 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-09-26 08:11:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,397 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:11:48,397 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:11:48,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:11:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:11:48,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:11:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:11:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-26 08:11:48,413 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-09-26 08:11:48,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,414 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-26 08:11:48,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:11:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-26 08:11:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:11:48,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,418 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-09-26 08:11:48,418 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,418 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 16 times [2018-09-26 08:11:48,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-09-26 08:11:48,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:48,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:11:48,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:11:48,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:11:48,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:11:48,510 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 19 states. [2018-09-26 08:11:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,547 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-09-26 08:11:48,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:11:48,547 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-09-26 08:11:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,548 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:11:48,549 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:11:48,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:11:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:11:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:11:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:11:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-26 08:11:48,560 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-09-26 08:11:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,560 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-26 08:11:48,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:11:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-26 08:11:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:11:48,561 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,569 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-09-26 08:11:48,570 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,571 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 17 times [2018-09-26 08:11:48,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-09-26 08:11:48,678 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:48,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:11:48,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:11:48,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:11:48,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:11:48,680 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 20 states. [2018-09-26 08:11:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,716 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-09-26 08:11:48,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:11:48,716 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-09-26 08:11:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,717 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:11:48,717 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:11:48,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:11:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:11:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:11:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:11:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-26 08:11:48,733 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2018-09-26 08:11:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,736 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-26 08:11:48,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:11:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-26 08:11:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:11:48,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,737 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-09-26 08:11:48,738 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 18 times [2018-09-26 08:11:48,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-09-26 08:11:48,848 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:48,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:11:48,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:11:48,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:11:48,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:11:48,850 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 21 states. [2018-09-26 08:11:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,893 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2018-09-26 08:11:48,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:11:48,894 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-09-26 08:11:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,896 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:11:48,896 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:11:48,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:11:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:11:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:11:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:11:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-26 08:11:48,905 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2018-09-26 08:11:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,906 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-26 08:11:48,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:11:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-26 08:11:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:11:48,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,908 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-09-26 08:11:48,909 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 19 times [2018-09-26 08:11:48,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-09-26 08:11:49,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:49,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:11:49,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:11:49,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:11:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:11:49,035 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 22 states. [2018-09-26 08:11:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:49,093 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-09-26 08:11:49,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:11:49,093 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-09-26 08:11:49,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:49,095 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:11:49,095 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:11:49,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:11:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:11:49,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:11:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:11:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-26 08:11:49,102 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-09-26 08:11:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:49,103 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-26 08:11:49,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:11:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-26 08:11:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:11:49,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:49,105 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-09-26 08:11:49,105 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:49,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:49,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 20 times [2018-09-26 08:11:49,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:49,223 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-09-26 08:11:49,224 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:49,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:11:49,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:11:49,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:11:49,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:11:49,228 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 23 states. [2018-09-26 08:11:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:49,271 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2018-09-26 08:11:49,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:11:49,271 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-09-26 08:11:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:49,272 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:11:49,273 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:11:49,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:11:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:11:49,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:11:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:11:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-26 08:11:49,280 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-09-26 08:11:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:49,281 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-26 08:11:49,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:11:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-26 08:11:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:11:49,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:49,286 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-09-26 08:11:49,286 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:49,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:49,287 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 21 times [2018-09-26 08:11:49,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-09-26 08:11:49,426 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:49,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:11:49,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:11:49,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:11:49,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:11:49,428 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 24 states. [2018-09-26 08:11:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:49,474 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-09-26 08:11:49,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:11:49,474 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-09-26 08:11:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:49,475 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:11:49,475 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:11:49,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:11:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:11:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:11:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:11:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-26 08:11:49,484 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 90 [2018-09-26 08:11:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:49,484 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-26 08:11:49,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:11:49,485 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-26 08:11:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:11:49,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:49,486 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-09-26 08:11:49,486 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:49,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:49,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 22 times [2018-09-26 08:11:49,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-09-26 08:11:49,620 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:49,620 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:11:49,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:11:49,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:11:49,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:11:49,622 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 25 states. [2018-09-26 08:11:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:49,667 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2018-09-26 08:11:49,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:11:49,667 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-09-26 08:11:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:49,668 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:11:49,668 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:11:49,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:11:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:11:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:11:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:11:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-26 08:11:49,675 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2018-09-26 08:11:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:49,675 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-26 08:11:49,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:11:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-26 08:11:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:11:49,677 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:49,677 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-09-26 08:11:49,677 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:49,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:49,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 23 times [2018-09-26 08:11:49,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-09-26 08:11:49,837 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:49,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:11:49,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:11:49,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:11:49,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:11:49,839 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 26 states. [2018-09-26 08:11:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:49,888 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2018-09-26 08:11:49,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:11:49,889 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 98 [2018-09-26 08:11:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:49,890 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:11:49,890 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:11:49,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:11:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:11:49,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:11:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:11:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-26 08:11:49,897 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2018-09-26 08:11:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:49,897 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-26 08:11:49,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:11:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-26 08:11:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:11:49,898 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:49,899 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-09-26 08:11:49,899 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:49,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:49,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 24 times [2018-09-26 08:11:49,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-09-26 08:11:50,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:50,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:11:50,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:11:50,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:11:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:11:50,124 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 27 states. [2018-09-26 08:11:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:50,173 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-09-26 08:11:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:11:50,173 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2018-09-26 08:11:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:50,174 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:11:50,174 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:11:50,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:11:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:11:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:11:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:11:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-26 08:11:50,181 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2018-09-26 08:11:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:50,182 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-26 08:11:50,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:11:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-26 08:11:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:11:50,183 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:50,183 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-09-26 08:11:50,183 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:50,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 25 times [2018-09-26 08:11:50,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-09-26 08:11:50,314 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:50,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:11:50,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:11:50,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:11:50,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:11:50,316 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 28 states. [2018-09-26 08:11:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:50,370 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-09-26 08:11:50,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:11:50,370 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 106 [2018-09-26 08:11:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:50,371 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:11:50,371 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:11:50,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:11:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:11:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:11:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:11:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-26 08:11:50,377 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2018-09-26 08:11:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:50,378 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-26 08:11:50,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:11:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-26 08:11:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:11:50,379 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:50,379 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-09-26 08:11:50,380 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:50,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:50,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 26 times [2018-09-26 08:11:50,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-09-26 08:11:50,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:50,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:11:50,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:11:50,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:11:50,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:11:50,515 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 29 states. [2018-09-26 08:11:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:50,565 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-09-26 08:11:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:11:50,565 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 110 [2018-09-26 08:11:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:50,566 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:11:50,566 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:11:50,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:11:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:11:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:11:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:11:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-26 08:11:50,572 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2018-09-26 08:11:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:50,573 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-26 08:11:50,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:11:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-26 08:11:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:11:50,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:50,574 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-09-26 08:11:50,574 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:50,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:50,575 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 27 times [2018-09-26 08:11:50,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-09-26 08:11:50,706 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:50,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:11:50,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:11:50,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:11:50,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:11:50,708 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 30 states. [2018-09-26 08:11:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:50,761 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-09-26 08:11:50,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:11:50,762 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 114 [2018-09-26 08:11:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:50,763 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:11:50,763 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:11:50,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:11:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:11:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:11:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:11:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-26 08:11:50,770 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-09-26 08:11:50,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:50,770 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-26 08:11:50,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:11:50,770 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-26 08:11:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:11:50,771 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:50,771 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-09-26 08:11:50,772 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:50,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:50,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 28 times [2018-09-26 08:11:50,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-09-26 08:11:50,913 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:50,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:11:50,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:11:50,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:11:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:11:50,915 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 31 states. [2018-09-26 08:11:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:50,971 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2018-09-26 08:11:50,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:11:50,972 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 118 [2018-09-26 08:11:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:50,973 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:11:50,973 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:11:50,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:11:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:11:50,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:11:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:11:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-26 08:11:50,979 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2018-09-26 08:11:50,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:50,980 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-26 08:11:50,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:11:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-26 08:11:50,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:11:50,981 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:50,981 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-09-26 08:11:50,982 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:50,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:50,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 29 times [2018-09-26 08:11:50,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-09-26 08:11:51,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:51,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:11:51,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:11:51,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:11:51,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:11:51,130 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 32 states. [2018-09-26 08:11:51,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:51,190 INFO L93 Difference]: Finished difference Result 189 states and 192 transitions. [2018-09-26 08:11:51,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:11:51,190 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 122 [2018-09-26 08:11:51,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:51,191 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:11:51,191 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:11:51,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:11:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:11:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:11:51,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:11:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-26 08:11:51,198 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2018-09-26 08:11:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:51,198 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-26 08:11:51,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:11:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-26 08:11:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:11:51,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:51,200 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-09-26 08:11:51,200 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:51,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:51,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 30 times [2018-09-26 08:11:51,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-09-26 08:11:51,352 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:51,352 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:11:51,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:11:51,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:11:51,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:11:51,354 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 33 states. [2018-09-26 08:11:51,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:51,409 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2018-09-26 08:11:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:11:51,409 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 126 [2018-09-26 08:11:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:51,410 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:11:51,411 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:11:51,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:11:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:11:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:11:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:11:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-26 08:11:51,417 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2018-09-26 08:11:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:51,418 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-26 08:11:51,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:11:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-26 08:11:51,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:11:51,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:51,419 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-09-26 08:11:51,419 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:51,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:51,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 31 times [2018-09-26 08:11:51,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-09-26 08:11:51,576 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:51,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:11:51,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:11:51,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:11:51,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:11:51,578 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 34 states. [2018-09-26 08:11:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:51,647 INFO L93 Difference]: Finished difference Result 201 states and 204 transitions. [2018-09-26 08:11:51,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:11:51,647 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 130 [2018-09-26 08:11:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:51,648 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:11:51,648 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:11:51,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:11:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:11:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:11:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:11:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-26 08:11:51,655 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 130 [2018-09-26 08:11:51,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:51,656 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-26 08:11:51,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:11:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-26 08:11:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:11:51,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:51,658 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-09-26 08:11:51,658 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:51,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 32 times [2018-09-26 08:11:51,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-09-26 08:11:51,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:51,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:11:51,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:11:51,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:11:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:11:51,823 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 35 states. [2018-09-26 08:11:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:51,899 INFO L93 Difference]: Finished difference Result 207 states and 210 transitions. [2018-09-26 08:11:51,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:11:51,899 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-09-26 08:11:51,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:51,900 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:11:51,901 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:11:51,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:11:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:11:51,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:11:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:11:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-26 08:11:51,908 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-09-26 08:11:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:51,908 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-26 08:11:51,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:11:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-26 08:11:51,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:11:51,910 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:51,910 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-09-26 08:11:51,911 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:51,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:51,911 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 33 times [2018-09-26 08:11:51,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-09-26 08:11:52,106 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:52,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:11:52,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:11:52,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:11:52,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:11:52,108 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 36 states. [2018-09-26 08:11:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:52,185 INFO L93 Difference]: Finished difference Result 213 states and 216 transitions. [2018-09-26 08:11:52,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:11:52,185 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 138 [2018-09-26 08:11:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:52,186 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:11:52,187 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:11:52,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 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:11:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:11:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:11:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:11:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-26 08:11:52,195 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 138 [2018-09-26 08:11:52,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:52,195 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-26 08:11:52,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:11:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-26 08:11:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:11:52,197 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:52,197 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-09-26 08:11:52,198 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:52,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:52,198 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 34 times [2018-09-26 08:11:52,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-09-26 08:11:52,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:52,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:11:52,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:11:52,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:11:52,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:11:52,451 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 37 states. [2018-09-26 08:11:52,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:52,532 INFO L93 Difference]: Finished difference Result 219 states and 222 transitions. [2018-09-26 08:11:52,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:11:52,533 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 142 [2018-09-26 08:11:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:52,534 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:11:52,534 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:11:52,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:11:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:11:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:11:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:11:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-09-26 08:11:52,541 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 142 [2018-09-26 08:11:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:52,541 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-09-26 08:11:52,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:11:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-09-26 08:11:52,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:11:52,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:52,543 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-09-26 08:11:52,544 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:52,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:52,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1526364071, now seen corresponding path program 35 times [2018-09-26 08:11:52,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-09-26 08:11:52,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:52,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:11:52,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:11:52,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:11:52,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:11:52,734 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 38 states. [2018-09-26 08:11:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:52,817 INFO L93 Difference]: Finished difference Result 225 states and 228 transitions. [2018-09-26 08:11:52,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:11:52,818 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 146 [2018-09-26 08:11:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:52,819 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:11:52,819 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:11:52,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:11:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:11:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:11:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:11:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-09-26 08:11:52,826 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2018-09-26 08:11:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:52,826 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-09-26 08:11:52,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:11:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-09-26 08:11:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:11:52,828 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:52,828 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1] [2018-09-26 08:11:52,829 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:52,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:52,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2109708315, now seen corresponding path program 36 times [2018-09-26 08:11:52,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2018-09-26 08:11:53,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:53,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:11:53,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:11:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:11:53,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:11:53,044 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 39 states. [2018-09-26 08:11:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:53,133 INFO L93 Difference]: Finished difference Result 231 states and 234 transitions. [2018-09-26 08:11:53,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:11:53,133 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-09-26 08:11:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:53,134 INFO L225 Difference]: With dead ends: 231 [2018-09-26 08:11:53,135 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:11:53,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:11:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:11:53,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:11:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:11:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-09-26 08:11:53,142 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 150 [2018-09-26 08:11:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:53,143 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-09-26 08:11:53,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:11:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-09-26 08:11:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:11:53,146 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:53,146 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-09-26 08:11:53,147 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:53,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:53,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1900215951, now seen corresponding path program 37 times [2018-09-26 08:11:53,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-09-26 08:11:53,345 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:53,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:11:53,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:11:53,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:11:53,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:11:53,347 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 40 states. [2018-09-26 08:11:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:53,431 INFO L93 Difference]: Finished difference Result 237 states and 240 transitions. [2018-09-26 08:11:53,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:11:53,431 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-09-26 08:11:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:53,432 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:11:53,432 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:11:53,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:11:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:11:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:11:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:11:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-09-26 08:11:53,443 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2018-09-26 08:11:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:53,443 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-09-26 08:11:53,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:11:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-09-26 08:11:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:11:53,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:53,446 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1] [2018-09-26 08:11:53,446 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:53,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:53,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1266046205, now seen corresponding path program 38 times [2018-09-26 08:11:53,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-09-26 08:11:53,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:53,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:11:53,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:11:53,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:11:53,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:11:53,650 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 41 states. [2018-09-26 08:11:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:53,743 INFO L93 Difference]: Finished difference Result 243 states and 246 transitions. [2018-09-26 08:11:53,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:11:53,743 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2018-09-26 08:11:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:53,745 INFO L225 Difference]: With dead ends: 243 [2018-09-26 08:11:53,745 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:11:53,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:11:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:11:53,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:11:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:11:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-09-26 08:11:53,753 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 158 [2018-09-26 08:11:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:53,753 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-09-26 08:11:53,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:11:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-09-26 08:11:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:11:53,755 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:53,755 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-09-26 08:11:53,755 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:53,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:53,756 INFO L82 PathProgramCache]: Analyzing trace with hash 907582839, now seen corresponding path program 39 times [2018-09-26 08:11:53,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2018-09-26 08:11:53,958 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:53,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:11:53,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:11:53,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:11:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:11:53,960 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 42 states. [2018-09-26 08:11:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:54,054 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2018-09-26 08:11:54,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:11:54,054 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2018-09-26 08:11:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:54,056 INFO L225 Difference]: With dead ends: 249 [2018-09-26 08:11:54,056 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:11:54,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:11:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:11:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:11:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:11:54,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-09-26 08:11:54,063 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 162 [2018-09-26 08:11:54,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:54,064 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-09-26 08:11:54,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:11:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-09-26 08:11:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:11:54,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:54,066 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1] [2018-09-26 08:11:54,066 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:54,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:54,066 INFO L82 PathProgramCache]: Analyzing trace with hash 334812651, now seen corresponding path program 40 times [2018-09-26 08:11:54,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-09-26 08:11:54,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:54,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:11:54,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:11:54,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:11:54,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:11:54,268 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 43 states. [2018-09-26 08:11:54,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:54,365 INFO L93 Difference]: Finished difference Result 255 states and 258 transitions. [2018-09-26 08:11:54,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:11:54,365 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 166 [2018-09-26 08:11:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:54,366 INFO L225 Difference]: With dead ends: 255 [2018-09-26 08:11:54,367 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:11:54,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:11:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:11:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:11:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:11:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-09-26 08:11:54,374 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 166 [2018-09-26 08:11:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:54,375 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-09-26 08:11:54,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:11:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-09-26 08:11:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:11:54,377 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:54,377 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-09-26 08:11:54,377 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:54,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:54,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1537430623, now seen corresponding path program 41 times [2018-09-26 08:11:54,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-09-26 08:11:54,611 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:54,611 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:11:54,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:11:54,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:11:54,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:11:54,614 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 44 states. [2018-09-26 08:11:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:54,723 INFO L93 Difference]: Finished difference Result 261 states and 264 transitions. [2018-09-26 08:11:54,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:11:54,724 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 170 [2018-09-26 08:11:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:54,725 INFO L225 Difference]: With dead ends: 261 [2018-09-26 08:11:54,725 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:11:54,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:11:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:11:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:11:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:11:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-09-26 08:11:54,734 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 170 [2018-09-26 08:11:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:54,735 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-09-26 08:11:54,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:11:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-09-26 08:11:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:11:54,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:54,737 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1] [2018-09-26 08:11:54,738 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:54,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:54,738 INFO L82 PathProgramCache]: Analyzing trace with hash -903276333, now seen corresponding path program 42 times [2018-09-26 08:11:54,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2018-09-26 08:11:55,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:55,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:11:55,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:11:55,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:11:55,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:11:55,014 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 45 states. [2018-09-26 08:11:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:55,125 INFO L93 Difference]: Finished difference Result 267 states and 270 transitions. [2018-09-26 08:11:55,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:11:55,126 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 174 [2018-09-26 08:11:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:55,127 INFO L225 Difference]: With dead ends: 267 [2018-09-26 08:11:55,127 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:11:55,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:11:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:11:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:11:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:11:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-09-26 08:11:55,137 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 174 [2018-09-26 08:11:55,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:55,138 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-09-26 08:11:55,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:11:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-09-26 08:11:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:11:55,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:55,162 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-09-26 08:11:55,163 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:55,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:55,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1945427129, now seen corresponding path program 43 times [2018-09-26 08:11:55,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-09-26 08:11:55,386 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:55,386 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:11:55,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:11:55,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:11:55,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:11:55,392 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 46 states. [2018-09-26 08:11:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:55,510 INFO L93 Difference]: Finished difference Result 273 states and 276 transitions. [2018-09-26 08:11:55,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:11:55,510 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 178 [2018-09-26 08:11:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:55,512 INFO L225 Difference]: With dead ends: 273 [2018-09-26 08:11:55,512 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:11:55,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:11:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:11:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:11:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:11:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-09-26 08:11:55,522 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 178 [2018-09-26 08:11:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:55,522 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-09-26 08:11:55,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:11:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-09-26 08:11:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:11:55,524 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:55,525 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1] [2018-09-26 08:11:55,525 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:55,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:55,525 INFO L82 PathProgramCache]: Analyzing trace with hash -45190213, now seen corresponding path program 44 times [2018-09-26 08:11:55,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-09-26 08:11:55,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:55,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:11:55,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:11:55,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:11:55,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:11:55,754 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 47 states. [2018-09-26 08:11:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:55,876 INFO L93 Difference]: Finished difference Result 279 states and 282 transitions. [2018-09-26 08:11:55,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:11:55,876 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 182 [2018-09-26 08:11:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:55,877 INFO L225 Difference]: With dead ends: 279 [2018-09-26 08:11:55,877 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:11:55,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:11:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:11:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:11:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:11:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-09-26 08:11:55,885 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 182 [2018-09-26 08:11:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:55,886 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-09-26 08:11:55,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:11:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-09-26 08:11:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:11:55,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:55,888 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-09-26 08:11:55,888 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:55,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:55,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1769474607, now seen corresponding path program 45 times [2018-09-26 08:11:55,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2018-09-26 08:11:56,114 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:56,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:11:56,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:11:56,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:11:56,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:11:56,116 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 48 states. [2018-09-26 08:11:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:56,229 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2018-09-26 08:11:56,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:11:56,230 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 186 [2018-09-26 08:11:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:56,231 INFO L225 Difference]: With dead ends: 285 [2018-09-26 08:11:56,231 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:11:56,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:11:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:11:56,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-26 08:11:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:11:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-09-26 08:11:56,239 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 186 [2018-09-26 08:11:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:56,240 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-09-26 08:11:56,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:11:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-09-26 08:11:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:11:56,242 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:56,242 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1] [2018-09-26 08:11:56,242 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:56,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash -879958365, now seen corresponding path program 46 times [2018-09-26 08:11:56,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-09-26 08:11:56,463 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:56,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:11:56,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:11:56,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:11:56,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:11:56,465 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 49 states. [2018-09-26 08:11:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:56,611 INFO L93 Difference]: Finished difference Result 291 states and 294 transitions. [2018-09-26 08:11:56,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:11:56,612 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 190 [2018-09-26 08:11:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:56,613 INFO L225 Difference]: With dead ends: 291 [2018-09-26 08:11:56,613 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:11:56,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:11:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:11:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-26 08:11:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:11:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-09-26 08:11:56,622 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 190 [2018-09-26 08:11:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:56,623 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-09-26 08:11:56,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:11:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-09-26 08:11:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:11:56,625 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:56,625 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-09-26 08:11:56,625 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:56,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:56,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1911420649, now seen corresponding path program 47 times [2018-09-26 08:11:56,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-09-26 08:11:56,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:56,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:11:56,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:11:56,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:11:56,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:11:56,862 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 50 states. [2018-09-26 08:11:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:57,006 INFO L93 Difference]: Finished difference Result 297 states and 300 transitions. [2018-09-26 08:11:57,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:11:57,007 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 194 [2018-09-26 08:11:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:57,008 INFO L225 Difference]: With dead ends: 297 [2018-09-26 08:11:57,008 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:11:57,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:11:57,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:11:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-26 08:11:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:11:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-09-26 08:11:57,017 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 194 [2018-09-26 08:11:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:57,017 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-09-26 08:11:57,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:11:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-09-26 08:11:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:11:57,020 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:57,020 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1] [2018-09-26 08:11:57,020 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:57,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:57,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1259106699, now seen corresponding path program 48 times [2018-09-26 08:11:57,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-09-26 08:11:57,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:57,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:11:57,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:11:57,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:11:57,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:11:57,262 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 51 states. [2018-09-26 08:11:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:57,401 INFO L93 Difference]: Finished difference Result 303 states and 306 transitions. [2018-09-26 08:11:57,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:11:57,402 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 198 [2018-09-26 08:11:57,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:57,403 INFO L225 Difference]: With dead ends: 303 [2018-09-26 08:11:57,403 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:11:57,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:11:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:11:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:11:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:11:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-09-26 08:11:57,412 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 198 [2018-09-26 08:11:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:57,413 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-09-26 08:11:57,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:11:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-09-26 08:11:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:11:57,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:57,415 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-09-26 08:11:57,415 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:57,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:57,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1946083329, now seen corresponding path program 49 times [2018-09-26 08:11:57,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-09-26 08:11:57,694 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:57,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:11:57,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:11:57,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:11:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:11:57,697 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 52 states. [2018-09-26 08:11:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:57,913 INFO L93 Difference]: Finished difference Result 309 states and 312 transitions. [2018-09-26 08:11:57,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:11:57,914 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 202 [2018-09-26 08:11:57,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:57,915 INFO L225 Difference]: With dead ends: 309 [2018-09-26 08:11:57,915 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:11:57,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:11:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:11:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-09-26 08:11:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:11:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-09-26 08:11:57,926 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 202 [2018-09-26 08:11:57,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:57,927 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-09-26 08:11:57,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:11:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-09-26 08:11:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:11:57,929 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:57,930 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1] [2018-09-26 08:11:57,930 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:57,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:57,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1980427149, now seen corresponding path program 50 times [2018-09-26 08:11:57,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-09-26 08:11:58,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:58,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:11:58,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:11:58,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:11:58,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:11:58,249 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 53 states. [2018-09-26 08:11:58,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:58,448 INFO L93 Difference]: Finished difference Result 315 states and 318 transitions. [2018-09-26 08:11:58,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:11:58,448 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 206 [2018-09-26 08:11:58,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:58,450 INFO L225 Difference]: With dead ends: 315 [2018-09-26 08:11:58,450 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:11:58,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 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:11:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:11:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-26 08:11:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:11:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-09-26 08:11:58,459 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 206 [2018-09-26 08:11:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:58,459 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-09-26 08:11:58,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:11:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-09-26 08:11:58,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:11:58,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:58,462 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-09-26 08:11:58,462 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:58,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:58,462 INFO L82 PathProgramCache]: Analyzing trace with hash -311603481, now seen corresponding path program 51 times [2018-09-26 08:11:58,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2018-09-26 08:11:58,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:58,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:11:58,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:11:58,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:11:58,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:11:58,720 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 54 states. [2018-09-26 08:11:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:58,917 INFO L93 Difference]: Finished difference Result 321 states and 324 transitions. [2018-09-26 08:11:58,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:11:58,917 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2018-09-26 08:11:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:58,919 INFO L225 Difference]: With dead ends: 321 [2018-09-26 08:11:58,919 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:11:58,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:11:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:11:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-09-26 08:11:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:11:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-09-26 08:11:58,931 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 210 [2018-09-26 08:11:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:58,932 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-09-26 08:11:58,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:11:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-09-26 08:11:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:11:58,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:58,935 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1] [2018-09-26 08:11:58,935 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:58,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1905340581, now seen corresponding path program 52 times [2018-09-26 08:11:58,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2018-09-26 08:11:59,198 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:59,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:11:59,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:11:59,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:11:59,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:11:59,202 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 55 states. [2018-09-26 08:11:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:59,450 INFO L93 Difference]: Finished difference Result 327 states and 330 transitions. [2018-09-26 08:11:59,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:11:59,451 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 214 [2018-09-26 08:11:59,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:59,452 INFO L225 Difference]: With dead ends: 327 [2018-09-26 08:11:59,452 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:11:59,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:11:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:11:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-09-26 08:11:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:11:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-09-26 08:11:59,462 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 214 [2018-09-26 08:11:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:59,463 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-09-26 08:11:59,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:11:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-09-26 08:11:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:11:59,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:59,466 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-09-26 08:11:59,466 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:59,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash 880711119, now seen corresponding path program 53 times [2018-09-26 08:11:59,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-09-26 08:11:59,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:59,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:11:59,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:11:59,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:11:59,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:11:59,734 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 56 states. [2018-09-26 08:11:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:59,980 INFO L93 Difference]: Finished difference Result 333 states and 336 transitions. [2018-09-26 08:11:59,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:11:59,981 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 218 [2018-09-26 08:11:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:59,982 INFO L225 Difference]: With dead ends: 333 [2018-09-26 08:11:59,983 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:11:59,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:11:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:11:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-09-26 08:11:59,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:11:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-09-26 08:11:59,994 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 218 [2018-09-26 08:11:59,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:59,995 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-09-26 08:11:59,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:11:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-09-26 08:11:59,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:11:59,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:59,998 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1] [2018-09-26 08:11:59,999 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:59,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:59,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1453433411, now seen corresponding path program 54 times [2018-09-26 08:11:59,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-09-26 08:12:00,277 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:00,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:12:00,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:12:00,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:12:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:12:00,279 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 57 states. [2018-09-26 08:12:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:00,567 INFO L93 Difference]: Finished difference Result 339 states and 342 transitions. [2018-09-26 08:12:00,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:12:00,567 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2018-09-26 08:12:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:00,569 INFO L225 Difference]: With dead ends: 339 [2018-09-26 08:12:00,569 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:12:00,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:12:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:12:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-26 08:12:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:12:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-09-26 08:12:00,579 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 222 [2018-09-26 08:12:00,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:00,580 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-09-26 08:12:00,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:12:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-09-26 08:12:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:12:00,583 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:00,584 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2018-09-26 08:12:00,584 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:00,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:00,584 INFO L82 PathProgramCache]: Analyzing trace with hash -614665033, now seen corresponding path program 55 times [2018-09-26 08:12:00,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-09-26 08:12:00,872 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:00,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:12:00,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:12:00,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:12:00,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:12:00,874 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 58 states. [2018-09-26 08:12:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:01,125 INFO L93 Difference]: Finished difference Result 345 states and 348 transitions. [2018-09-26 08:12:01,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:12:01,126 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 226 [2018-09-26 08:12:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:01,128 INFO L225 Difference]: With dead ends: 345 [2018-09-26 08:12:01,128 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:12:01,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:12:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:12:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-09-26 08:12:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:12:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-09-26 08:12:01,141 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 226 [2018-09-26 08:12:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:01,142 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-09-26 08:12:01,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:12:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-09-26 08:12:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:12:01,145 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:01,146 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1] [2018-09-26 08:12:01,146 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:01,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:01,146 INFO L82 PathProgramCache]: Analyzing trace with hash -659190485, now seen corresponding path program 56 times [2018-09-26 08:12:01,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2018-09-26 08:12:01,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:01,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:12:01,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:12:01,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:12:01,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:12:01,494 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 59 states. [2018-09-26 08:12:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:01,699 INFO L93 Difference]: Finished difference Result 351 states and 354 transitions. [2018-09-26 08:12:01,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:12:01,701 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 230 [2018-09-26 08:12:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:01,703 INFO L225 Difference]: With dead ends: 351 [2018-09-26 08:12:01,703 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:12:01,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:12:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:12:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 08:12:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:12:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-09-26 08:12:01,713 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 230 [2018-09-26 08:12:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:01,713 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-09-26 08:12:01,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:12:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-09-26 08:12:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:12:01,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:01,719 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2018-09-26 08:12:01,719 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:01,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1412459423, now seen corresponding path program 57 times [2018-09-26 08:12:01,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2018-09-26 08:12:02,017 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:02,017 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:12:02,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:12:02,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:12:02,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:12:02,020 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 60 states. [2018-09-26 08:12:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:02,272 INFO L93 Difference]: Finished difference Result 357 states and 360 transitions. [2018-09-26 08:12:02,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:12:02,272 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 234 [2018-09-26 08:12:02,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:02,274 INFO L225 Difference]: With dead ends: 357 [2018-09-26 08:12:02,274 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:12:02,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:12:02,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:12:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-26 08:12:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 08:12:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-09-26 08:12:02,284 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 234 [2018-09-26 08:12:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:02,284 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-09-26 08:12:02,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:12:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-09-26 08:12:02,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:12:02,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:02,291 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1] [2018-09-26 08:12:02,292 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:02,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:02,292 INFO L82 PathProgramCache]: Analyzing trace with hash 47353875, now seen corresponding path program 58 times [2018-09-26 08:12:02,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2018-09-26 08:12:02,565 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:02,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:12:02,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:12:02,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:12:02,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:12:02,567 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 61 states. [2018-09-26 08:12:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:02,837 INFO L93 Difference]: Finished difference Result 363 states and 366 transitions. [2018-09-26 08:12:02,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:12:02,838 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 238 [2018-09-26 08:12:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:02,839 INFO L225 Difference]: With dead ends: 363 [2018-09-26 08:12:02,839 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:12:02,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:12:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:12:02,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-09-26 08:12:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 08:12:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-09-26 08:12:02,851 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 238 [2018-09-26 08:12:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:02,851 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-09-26 08:12:02,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:12:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-09-26 08:12:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-26 08:12:02,854 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:02,855 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2018-09-26 08:12:02,855 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:02,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash 153156231, now seen corresponding path program 59 times [2018-09-26 08:12:02,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-09-26 08:12:03,150 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:03,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:12:03,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:12:03,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:12:03,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:12:03,152 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 62 states. [2018-09-26 08:12:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:03,493 INFO L93 Difference]: Finished difference Result 369 states and 372 transitions. [2018-09-26 08:12:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:12:03,494 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 242 [2018-09-26 08:12:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:03,496 INFO L225 Difference]: With dead ends: 369 [2018-09-26 08:12:03,496 INFO L226 Difference]: Without dead ends: 247 [2018-09-26 08:12:03,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:12:03,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-09-26 08:12:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-09-26 08:12:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-26 08:12:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-09-26 08:12:03,505 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 242 [2018-09-26 08:12:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:03,506 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-09-26 08:12:03,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:12:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-09-26 08:12:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-26 08:12:03,509 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:03,510 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1] [2018-09-26 08:12:03,510 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:03,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:03,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1155486981, now seen corresponding path program 60 times [2018-09-26 08:12:03,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2018-09-26 08:12:03,830 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:03,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:12:03,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:12:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:12:03,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:12:03,832 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 63 states. [2018-09-26 08:12:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:04,157 INFO L93 Difference]: Finished difference Result 375 states and 378 transitions. [2018-09-26 08:12:04,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:12:04,158 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 246 [2018-09-26 08:12:04,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:04,160 INFO L225 Difference]: With dead ends: 375 [2018-09-26 08:12:04,160 INFO L226 Difference]: Without dead ends: 251 [2018-09-26 08:12:04,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:12:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-09-26 08:12:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-09-26 08:12:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:12:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-09-26 08:12:04,171 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 246 [2018-09-26 08:12:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:04,172 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-09-26 08:12:04,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:12:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-09-26 08:12:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:12:04,175 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:04,175 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2018-09-26 08:12:04,175 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:04,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1549181295, now seen corresponding path program 61 times [2018-09-26 08:12:04,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2018-09-26 08:12:04,592 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:04,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:12:04,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:12:04,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:12:04,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:12:04,595 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 64 states. [2018-09-26 08:12:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:04,976 INFO L93 Difference]: Finished difference Result 381 states and 384 transitions. [2018-09-26 08:12:04,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:12:04,976 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 250 [2018-09-26 08:12:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:04,978 INFO L225 Difference]: With dead ends: 381 [2018-09-26 08:12:04,978 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 08:12:04,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 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:12:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 08:12:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-09-26 08:12:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 08:12:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-09-26 08:12:04,990 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 250 [2018-09-26 08:12:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:04,990 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-09-26 08:12:04,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:12:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-09-26 08:12:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-26 08:12:04,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:04,994 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1] [2018-09-26 08:12:04,994 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:04,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:04,995 INFO L82 PathProgramCache]: Analyzing trace with hash -540549661, now seen corresponding path program 62 times [2018-09-26 08:12:04,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2018-09-26 08:12:05,354 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:05,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:12:05,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:12:05,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:12:05,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:12:05,356 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 65 states. [2018-09-26 08:12:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:05,745 INFO L93 Difference]: Finished difference Result 387 states and 390 transitions. [2018-09-26 08:12:05,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:12:05,746 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 254 [2018-09-26 08:12:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:05,747 INFO L225 Difference]: With dead ends: 387 [2018-09-26 08:12:05,748 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 08:12:05,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 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:12:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 08:12:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-09-26 08:12:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-26 08:12:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-09-26 08:12:05,767 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 254 [2018-09-26 08:12:05,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:05,767 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-09-26 08:12:05,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:12:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-09-26 08:12:05,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-26 08:12:05,774 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:05,774 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2018-09-26 08:12:05,774 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:05,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:05,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1476829097, now seen corresponding path program 63 times [2018-09-26 08:12:05,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2018-09-26 08:12:06,071 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:06,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:12:06,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:12:06,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:12:06,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:12:06,074 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 66 states. [2018-09-26 08:12:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:06,399 INFO L93 Difference]: Finished difference Result 393 states and 396 transitions. [2018-09-26 08:12:06,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:12:06,399 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 258 [2018-09-26 08:12:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:06,401 INFO L225 Difference]: With dead ends: 393 [2018-09-26 08:12:06,401 INFO L226 Difference]: Without dead ends: 263 [2018-09-26 08:12:06,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:12:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-09-26 08:12:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-09-26 08:12:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-09-26 08:12:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-09-26 08:12:06,417 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 258 [2018-09-26 08:12:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:06,417 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-09-26 08:12:06,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:12:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-09-26 08:12:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-26 08:12:06,423 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:06,424 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1] [2018-09-26 08:12:06,424 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:06,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:06,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1190144203, now seen corresponding path program 64 times [2018-09-26 08:12:06,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2018-09-26 08:12:06,728 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:06,728 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:12:06,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:12:06,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:12:06,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:12:06,730 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 67 states. [2018-09-26 08:12:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:07,069 INFO L93 Difference]: Finished difference Result 399 states and 402 transitions. [2018-09-26 08:12:07,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:12:07,070 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 262 [2018-09-26 08:12:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:07,071 INFO L225 Difference]: With dead ends: 399 [2018-09-26 08:12:07,071 INFO L226 Difference]: Without dead ends: 267 [2018-09-26 08:12:07,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:12:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-09-26 08:12:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-09-26 08:12:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:12:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-09-26 08:12:07,082 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 262 [2018-09-26 08:12:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:07,083 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-09-26 08:12:07,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:12:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-09-26 08:12:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-26 08:12:07,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:07,087 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1] [2018-09-26 08:12:07,087 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:07,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:07,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1043412799, now seen corresponding path program 65 times [2018-09-26 08:12:07,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-09-26 08:12:07,422 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:07,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:12:07,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:12:07,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:12:07,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:12:07,424 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 68 states. [2018-09-26 08:12:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:07,815 INFO L93 Difference]: Finished difference Result 405 states and 408 transitions. [2018-09-26 08:12:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:12:07,815 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 266 [2018-09-26 08:12:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:07,817 INFO L225 Difference]: With dead ends: 405 [2018-09-26 08:12:07,817 INFO L226 Difference]: Without dead ends: 271 [2018-09-26 08:12:07,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:12:07,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-09-26 08:12:07,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-09-26 08:12:07,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-26 08:12:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-09-26 08:12:07,828 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 266 [2018-09-26 08:12:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:07,829 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-09-26 08:12:07,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:12:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-09-26 08:12:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-26 08:12:07,833 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:07,833 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1] [2018-09-26 08:12:07,834 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:07,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1094612045, now seen corresponding path program 66 times [2018-09-26 08:12:07,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-09-26 08:12:08,151 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:08,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:12:08,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:12:08,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:12:08,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:12:08,155 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 69 states. [2018-09-26 08:12:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:08,549 INFO L93 Difference]: Finished difference Result 411 states and 414 transitions. [2018-09-26 08:12:08,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:12:08,550 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 270 [2018-09-26 08:12:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:08,552 INFO L225 Difference]: With dead ends: 411 [2018-09-26 08:12:08,552 INFO L226 Difference]: Without dead ends: 275 [2018-09-26 08:12:08,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:12:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-26 08:12:08,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-09-26 08:12:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-26 08:12:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-09-26 08:12:08,561 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 270 [2018-09-26 08:12:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:08,561 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-09-26 08:12:08,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:12:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-09-26 08:12:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-26 08:12:08,565 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:08,565 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1] [2018-09-26 08:12:08,566 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:08,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:08,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1764107815, now seen corresponding path program 67 times [2018-09-26 08:12:08,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2018-09-26 08:12:08,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:08,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:12:08,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:12:08,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:12:08,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:12:08,925 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 70 states. [2018-09-26 08:12:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:09,272 INFO L93 Difference]: Finished difference Result 417 states and 420 transitions. [2018-09-26 08:12:09,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:12:09,272 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 274 [2018-09-26 08:12:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:09,274 INFO L225 Difference]: With dead ends: 417 [2018-09-26 08:12:09,274 INFO L226 Difference]: Without dead ends: 279 [2018-09-26 08:12:09,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 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:12:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-26 08:12:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-09-26 08:12:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-09-26 08:12:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-09-26 08:12:09,283 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 274 [2018-09-26 08:12:09,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:09,284 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-09-26 08:12:09,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:12:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-09-26 08:12:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-09-26 08:12:09,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:09,288 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1, 1, 1] [2018-09-26 08:12:09,288 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:09,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash 224659099, now seen corresponding path program 68 times [2018-09-26 08:12:09,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2018-09-26 08:12:09,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:09,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:12:09,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:12:09,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:12:09,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:12:09,591 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 71 states. [2018-09-26 08:12:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:10,097 INFO L93 Difference]: Finished difference Result 423 states and 426 transitions. [2018-09-26 08:12:10,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:12:10,097 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 278 [2018-09-26 08:12:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:10,099 INFO L225 Difference]: With dead ends: 423 [2018-09-26 08:12:10,099 INFO L226 Difference]: Without dead ends: 283 [2018-09-26 08:12:10,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:12:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-09-26 08:12:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-09-26 08:12:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-09-26 08:12:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-09-26 08:12:10,108 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 278 [2018-09-26 08:12:10,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:10,108 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-09-26 08:12:10,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:12:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-09-26 08:12:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-26 08:12:10,110 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:10,110 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1] [2018-09-26 08:12:10,111 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:10,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:10,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1795173647, now seen corresponding path program 69 times [2018-09-26 08:12:10,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2018-09-26 08:12:10,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:10,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:12:10,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:12:10,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:12:10,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:12:10,451 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 72 states. [2018-09-26 08:12:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:10,770 INFO L93 Difference]: Finished difference Result 429 states and 432 transitions. [2018-09-26 08:12:10,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:12:10,770 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 282 [2018-09-26 08:12:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:10,772 INFO L225 Difference]: With dead ends: 429 [2018-09-26 08:12:10,772 INFO L226 Difference]: Without dead ends: 287 [2018-09-26 08:12:10,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:12:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-09-26 08:12:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-09-26 08:12:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-09-26 08:12:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-09-26 08:12:10,782 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 282 [2018-09-26 08:12:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:10,782 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-09-26 08:12:10,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:12:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-09-26 08:12:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-26 08:12:10,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:10,784 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1, 1, 1] [2018-09-26 08:12:10,784 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:10,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:10,785 INFO L82 PathProgramCache]: Analyzing trace with hash -251684477, now seen corresponding path program 70 times [2018-09-26 08:12:10,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2018-09-26 08:12:11,106 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:11,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:12:11,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:12:11,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:12:11,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:12:11,108 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 73 states. [2018-09-26 08:12:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:11,601 INFO L93 Difference]: Finished difference Result 435 states and 438 transitions. [2018-09-26 08:12:11,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:12:11,602 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 286 [2018-09-26 08:12:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:11,604 INFO L225 Difference]: With dead ends: 435 [2018-09-26 08:12:11,604 INFO L226 Difference]: Without dead ends: 291 [2018-09-26 08:12:11,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:12:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-26 08:12:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-09-26 08:12:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-26 08:12:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-09-26 08:12:11,613 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 286 [2018-09-26 08:12:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:11,614 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-09-26 08:12:11,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:12:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-09-26 08:12:11,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-26 08:12:11,615 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:11,616 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1, 1, 1] [2018-09-26 08:12:11,616 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:11,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:11,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2112310263, now seen corresponding path program 71 times [2018-09-26 08:12:11,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2018-09-26 08:12:11,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:11,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:12:11,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:12:11,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:12:11,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:12:11,957 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 74 states. [2018-09-26 08:12:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:12,457 INFO L93 Difference]: Finished difference Result 441 states and 444 transitions. [2018-09-26 08:12:12,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:12:12,457 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 290 [2018-09-26 08:12:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:12,459 INFO L225 Difference]: With dead ends: 441 [2018-09-26 08:12:12,459 INFO L226 Difference]: Without dead ends: 295 [2018-09-26 08:12:12,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:12:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-09-26 08:12:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-09-26 08:12:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-09-26 08:12:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-09-26 08:12:12,470 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 290 [2018-09-26 08:12:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:12,471 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-09-26 08:12:12,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:12:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-09-26 08:12:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-09-26 08:12:12,473 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:12,473 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1, 1, 1] [2018-09-26 08:12:12,474 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:12,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:12,474 INFO L82 PathProgramCache]: Analyzing trace with hash 532431979, now seen corresponding path program 72 times [2018-09-26 08:12:12,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2018-09-26 08:12:12,953 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:12,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:12:12,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:12:12,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:12:12,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:12:12,955 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 75 states. [2018-09-26 08:12:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:13,486 INFO L93 Difference]: Finished difference Result 447 states and 450 transitions. [2018-09-26 08:12:13,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:12:13,486 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 294 [2018-09-26 08:12:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:13,488 INFO L225 Difference]: With dead ends: 447 [2018-09-26 08:12:13,488 INFO L226 Difference]: Without dead ends: 299 [2018-09-26 08:12:13,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:12:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-26 08:12:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-09-26 08:12:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-09-26 08:12:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-09-26 08:12:13,497 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 294 [2018-09-26 08:12:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:13,497 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-09-26 08:12:13,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:12:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-09-26 08:12:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-09-26 08:12:13,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:13,499 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1, 1, 1] [2018-09-26 08:12:13,500 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:13,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:13,500 INFO L82 PathProgramCache]: Analyzing trace with hash -737967393, now seen corresponding path program 73 times [2018-09-26 08:12:13,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-09-26 08:12:13,794 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:13,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:12:13,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:12:13,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:12:13,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:12:13,796 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 76 states. [2018-09-26 08:12:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:14,084 INFO L93 Difference]: Finished difference Result 453 states and 456 transitions. [2018-09-26 08:12:14,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:12:14,085 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 298 [2018-09-26 08:12:14,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:14,087 INFO L225 Difference]: With dead ends: 453 [2018-09-26 08:12:14,087 INFO L226 Difference]: Without dead ends: 303 [2018-09-26 08:12:14,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:12:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-09-26 08:12:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-09-26 08:12:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-09-26 08:12:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-09-26 08:12:14,095 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 298 [2018-09-26 08:12:14,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:14,096 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-09-26 08:12:14,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:12:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-09-26 08:12:14,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-09-26 08:12:14,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:14,098 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1, 1, 1] [2018-09-26 08:12:14,098 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:14,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:14,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1203898195, now seen corresponding path program 74 times [2018-09-26 08:12:14,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2018-09-26 08:12:14,361 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:14,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:12:14,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:12:14,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:12:14,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:12:14,363 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 77 states. [2018-09-26 08:12:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:14,772 INFO L93 Difference]: Finished difference Result 459 states and 462 transitions. [2018-09-26 08:12:14,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:12:14,772 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 302 [2018-09-26 08:12:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:14,774 INFO L225 Difference]: With dead ends: 459 [2018-09-26 08:12:14,774 INFO L226 Difference]: Without dead ends: 307 [2018-09-26 08:12:14,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:12:14,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-09-26 08:12:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-09-26 08:12:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-26 08:12:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-09-26 08:12:14,782 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 302 [2018-09-26 08:12:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:14,782 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-09-26 08:12:14,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:12:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-09-26 08:12:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-09-26 08:12:14,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:14,784 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1, 1, 1] [2018-09-26 08:12:14,785 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:14,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:14,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1753427513, now seen corresponding path program 75 times [2018-09-26 08:12:14,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2018-09-26 08:12:15,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:15,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:12:15,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:12:15,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:12:15,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:12:15,139 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 78 states. [2018-09-26 08:12:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:15,438 INFO L93 Difference]: Finished difference Result 465 states and 468 transitions. [2018-09-26 08:12:15,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:12:15,439 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 306 [2018-09-26 08:12:15,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:15,440 INFO L225 Difference]: With dead ends: 465 [2018-09-26 08:12:15,440 INFO L226 Difference]: Without dead ends: 311 [2018-09-26 08:12:15,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:12:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-09-26 08:12:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-09-26 08:12:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-09-26 08:12:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-09-26 08:12:15,448 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 306 [2018-09-26 08:12:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:15,449 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-09-26 08:12:15,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:12:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-09-26 08:12:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-26 08:12:15,450 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:15,451 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1, 1, 1] [2018-09-26 08:12:15,451 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:15,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:15,451 INFO L82 PathProgramCache]: Analyzing trace with hash 255386171, now seen corresponding path program 76 times [2018-09-26 08:12:15,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2018-09-26 08:12:15,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:15,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:12:15,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:12:15,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:12:15,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:12:15,786 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 79 states. [2018-09-26 08:12:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:16,160 INFO L93 Difference]: Finished difference Result 471 states and 474 transitions. [2018-09-26 08:12:16,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:12:16,160 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 310 [2018-09-26 08:12:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:16,162 INFO L225 Difference]: With dead ends: 471 [2018-09-26 08:12:16,162 INFO L226 Difference]: Without dead ends: 315 [2018-09-26 08:12:16,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:12:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-09-26 08:12:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-09-26 08:12:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-26 08:12:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-09-26 08:12:16,170 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 310 [2018-09-26 08:12:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:16,170 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-09-26 08:12:16,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:12:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-09-26 08:12:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-09-26 08:12:16,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:16,172 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1, 1, 1] [2018-09-26 08:12:16,173 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:16,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:16,173 INFO L82 PathProgramCache]: Analyzing trace with hash -361023313, now seen corresponding path program 77 times [2018-09-26 08:12:16,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2018-09-26 08:12:16,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:16,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:12:16,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:12:16,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:12:16,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:12:16,543 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 80 states. [2018-09-26 08:12:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:16,907 INFO L93 Difference]: Finished difference Result 477 states and 480 transitions. [2018-09-26 08:12:16,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:12:16,907 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 314 [2018-09-26 08:12:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:16,909 INFO L225 Difference]: With dead ends: 477 [2018-09-26 08:12:16,909 INFO L226 Difference]: Without dead ends: 319 [2018-09-26 08:12:16,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:12:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-09-26 08:12:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-09-26 08:12:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-26 08:12:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-09-26 08:12:16,917 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 314 [2018-09-26 08:12:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:16,918 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-09-26 08:12:16,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:12:16,918 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-09-26 08:12:16,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-09-26 08:12:16,919 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:16,920 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1, 1, 1] [2018-09-26 08:12:16,920 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:16,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:16,920 INFO L82 PathProgramCache]: Analyzing trace with hash 340317475, now seen corresponding path program 78 times [2018-09-26 08:12:16,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2018-09-26 08:12:17,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:17,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:12:17,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:12:17,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:12:17,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:12:17,259 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 81 states. [2018-09-26 08:12:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:17,632 INFO L93 Difference]: Finished difference Result 483 states and 486 transitions. [2018-09-26 08:12:17,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:12:17,632 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 318 [2018-09-26 08:12:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:17,634 INFO L225 Difference]: With dead ends: 483 [2018-09-26 08:12:17,634 INFO L226 Difference]: Without dead ends: 323 [2018-09-26 08:12:17,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:12:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-09-26 08:12:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-09-26 08:12:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-09-26 08:12:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 324 transitions. [2018-09-26 08:12:17,643 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 324 transitions. Word has length 318 [2018-09-26 08:12:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:17,643 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 324 transitions. [2018-09-26 08:12:17,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:12:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 324 transitions. [2018-09-26 08:12:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-09-26 08:12:17,645 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:17,645 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1, 1, 1] [2018-09-26 08:12:17,645 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:17,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:17,646 INFO L82 PathProgramCache]: Analyzing trace with hash -416893033, now seen corresponding path program 79 times [2018-09-26 08:12:17,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2018-09-26 08:12:17,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:17,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:12:17,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:12:17,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:12:17,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:12:17,934 INFO L87 Difference]: Start difference. First operand 323 states and 324 transitions. Second operand 82 states. [2018-09-26 08:12:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:18,226 INFO L93 Difference]: Finished difference Result 489 states and 492 transitions. [2018-09-26 08:12:18,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:12:18,226 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 322 [2018-09-26 08:12:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:18,227 INFO L225 Difference]: With dead ends: 489 [2018-09-26 08:12:18,227 INFO L226 Difference]: Without dead ends: 327 [2018-09-26 08:12:18,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:12:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-09-26 08:12:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-09-26 08:12:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-09-26 08:12:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-09-26 08:12:18,234 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 322 [2018-09-26 08:12:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:18,235 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-09-26 08:12:18,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:12:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-09-26 08:12:18,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-09-26 08:12:18,236 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:18,237 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1, 1, 1] [2018-09-26 08:12:18,237 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:18,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:18,237 INFO L82 PathProgramCache]: Analyzing trace with hash -317071349, now seen corresponding path program 80 times [2018-09-26 08:12:18,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2018-09-26 08:12:18,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:18,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:12:18,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:12:18,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:12:18,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:12:18,603 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 83 states. [2018-09-26 08:12:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:19,005 INFO L93 Difference]: Finished difference Result 495 states and 498 transitions. [2018-09-26 08:12:19,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:12:19,005 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 326 [2018-09-26 08:12:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:19,007 INFO L225 Difference]: With dead ends: 495 [2018-09-26 08:12:19,007 INFO L226 Difference]: Without dead ends: 331 [2018-09-26 08:12:19,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:12:19,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-09-26 08:12:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-09-26 08:12:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-09-26 08:12:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-09-26 08:12:19,015 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 326 [2018-09-26 08:12:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:19,015 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-09-26 08:12:19,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:12:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-09-26 08:12:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-09-26 08:12:19,017 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:19,018 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1, 1, 1] [2018-09-26 08:12:19,018 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:19,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:19,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1616425345, now seen corresponding path program 81 times [2018-09-26 08:12:19,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 6642 trivial. 0 not checked. [2018-09-26 08:12:19,364 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:19,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:12:19,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:12:19,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:12:19,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:12:19,366 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 84 states. [2018-09-26 08:12:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:19,738 INFO L93 Difference]: Finished difference Result 501 states and 504 transitions. [2018-09-26 08:12:19,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:12:19,738 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 330 [2018-09-26 08:12:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:19,740 INFO L225 Difference]: With dead ends: 501 [2018-09-26 08:12:19,740 INFO L226 Difference]: Without dead ends: 335 [2018-09-26 08:12:19,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:12:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-09-26 08:12:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-09-26 08:12:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-09-26 08:12:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-09-26 08:12:19,749 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 330 [2018-09-26 08:12:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:19,749 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-09-26 08:12:19,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:12:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-09-26 08:12:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-09-26 08:12:19,752 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:19,752 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1, 1, 1] [2018-09-26 08:12:19,752 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:19,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:19,753 INFO L82 PathProgramCache]: Analyzing trace with hash 668205811, now seen corresponding path program 82 times [2018-09-26 08:12:19,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2018-09-26 08:12:20,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:20,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:12:20,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:12:20,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:12:20,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:12:20,071 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 85 states. [2018-09-26 08:12:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:20,508 INFO L93 Difference]: Finished difference Result 507 states and 510 transitions. [2018-09-26 08:12:20,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:12:20,508 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 334 [2018-09-26 08:12:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:20,510 INFO L225 Difference]: With dead ends: 507 [2018-09-26 08:12:20,510 INFO L226 Difference]: Without dead ends: 339 [2018-09-26 08:12:20,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:12:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-09-26 08:12:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-09-26 08:12:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-26 08:12:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-09-26 08:12:20,521 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 334 [2018-09-26 08:12:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:20,521 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-09-26 08:12:20,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:12:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-09-26 08:12:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-09-26 08:12:20,523 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:20,524 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1, 1, 1] [2018-09-26 08:12:20,524 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:20,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:20,524 INFO L82 PathProgramCache]: Analyzing trace with hash 505740647, now seen corresponding path program 83 times [2018-09-26 08:12:20,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 6972 trivial. 0 not checked. [2018-09-26 08:12:20,799 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:20,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:12:20,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:12:20,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:12:20,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:12:20,800 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 86 states. [2018-09-26 08:12:21,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:21,286 INFO L93 Difference]: Finished difference Result 513 states and 516 transitions. [2018-09-26 08:12:21,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:12:21,287 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 338 [2018-09-26 08:12:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:21,288 INFO L225 Difference]: With dead ends: 513 [2018-09-26 08:12:21,288 INFO L226 Difference]: Without dead ends: 343 [2018-09-26 08:12:21,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:12:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-26 08:12:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-09-26 08:12:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-26 08:12:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-09-26 08:12:21,294 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 338 [2018-09-26 08:12:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:21,294 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-09-26 08:12:21,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:12:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-09-26 08:12:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-09-26 08:12:21,296 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:21,297 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1, 1, 1] [2018-09-26 08:12:21,297 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:21,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:21,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1251950043, now seen corresponding path program 84 times [2018-09-26 08:12:21,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2018-09-26 08:12:21,579 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:21,579 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:12:21,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:12:21,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:12:21,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:12:21,581 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 87 states. [2018-09-26 08:12:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:22,088 INFO L93 Difference]: Finished difference Result 519 states and 522 transitions. [2018-09-26 08:12:22,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:12:22,088 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 342 [2018-09-26 08:12:22,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:22,089 INFO L225 Difference]: With dead ends: 519 [2018-09-26 08:12:22,089 INFO L226 Difference]: Without dead ends: 347 [2018-09-26 08:12:22,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:12:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-09-26 08:12:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-09-26 08:12:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-09-26 08:12:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-09-26 08:12:22,096 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 342 [2018-09-26 08:12:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:22,097 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-09-26 08:12:22,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:12:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-09-26 08:12:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-09-26 08:12:22,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:22,099 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1, 1, 1] [2018-09-26 08:12:22,099 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:22,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:22,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1690813519, now seen corresponding path program 85 times [2018-09-26 08:12:22,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 7310 trivial. 0 not checked. [2018-09-26 08:12:22,428 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:22,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:12:22,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:12:22,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:12:22,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:12:22,430 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 88 states. [2018-09-26 08:12:22,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:22,939 INFO L93 Difference]: Finished difference Result 525 states and 528 transitions. [2018-09-26 08:12:22,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:12:22,940 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 346 [2018-09-26 08:12:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:22,941 INFO L225 Difference]: With dead ends: 525 [2018-09-26 08:12:22,941 INFO L226 Difference]: Without dead ends: 351 [2018-09-26 08:12:22,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:12:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-26 08:12:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-09-26 08:12:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-09-26 08:12:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-09-26 08:12:22,949 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 346 [2018-09-26 08:12:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:22,949 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-09-26 08:12:22,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:12:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-09-26 08:12:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-09-26 08:12:22,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:22,952 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1, 1, 1] [2018-09-26 08:12:22,952 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:22,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:22,952 INFO L82 PathProgramCache]: Analyzing trace with hash -744255293, now seen corresponding path program 86 times [2018-09-26 08:12:22,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 7482 trivial. 0 not checked. [2018-09-26 08:12:23,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:23,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:12:23,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:12:23,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:12:23,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:12:23,253 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 89 states. [2018-09-26 08:12:23,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:23,554 INFO L93 Difference]: Finished difference Result 531 states and 534 transitions. [2018-09-26 08:12:23,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:12:23,554 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 350 [2018-09-26 08:12:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:23,556 INFO L225 Difference]: With dead ends: 531 [2018-09-26 08:12:23,556 INFO L226 Difference]: Without dead ends: 355 [2018-09-26 08:12:23,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:12:23,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-09-26 08:12:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-09-26 08:12:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-09-26 08:12:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-09-26 08:12:23,562 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 350 [2018-09-26 08:12:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:23,562 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-09-26 08:12:23,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:12:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-09-26 08:12:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-09-26 08:12:23,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:23,564 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1, 1, 1] [2018-09-26 08:12:23,564 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:23,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:23,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1840751415, now seen corresponding path program 87 times [2018-09-26 08:12:23,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15312 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 7656 trivial. 0 not checked. [2018-09-26 08:12:23,823 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:23,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:12:23,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:12:23,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:12:23,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:12:23,825 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 90 states. [2018-09-26 08:12:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:24,378 INFO L93 Difference]: Finished difference Result 537 states and 540 transitions. [2018-09-26 08:12:24,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:12:24,379 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 354 [2018-09-26 08:12:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:24,380 INFO L225 Difference]: With dead ends: 537 [2018-09-26 08:12:24,381 INFO L226 Difference]: Without dead ends: 359 [2018-09-26 08:12:24,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:12:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-09-26 08:12:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-09-26 08:12:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-09-26 08:12:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-09-26 08:12:24,389 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 354 [2018-09-26 08:12:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:24,390 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-09-26 08:12:24,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:12:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-09-26 08:12:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-09-26 08:12:24,391 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:24,391 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1, 1, 1] [2018-09-26 08:12:24,391 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:24,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:24,392 INFO L82 PathProgramCache]: Analyzing trace with hash 956890027, now seen corresponding path program 88 times [2018-09-26 08:12:24,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 7832 trivial. 0 not checked. [2018-09-26 08:12:24,666 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:24,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:12:24,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:12:24,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:12:24,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:12:24,668 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 91 states. [2018-09-26 08:12:25,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:25,276 INFO L93 Difference]: Finished difference Result 543 states and 546 transitions. [2018-09-26 08:12:25,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:12:25,276 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 358 [2018-09-26 08:12:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:25,278 INFO L225 Difference]: With dead ends: 543 [2018-09-26 08:12:25,278 INFO L226 Difference]: Without dead ends: 363 [2018-09-26 08:12:25,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:12:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-09-26 08:12:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-09-26 08:12:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-09-26 08:12:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 364 transitions. [2018-09-26 08:12:25,286 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 364 transitions. Word has length 358 [2018-09-26 08:12:25,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:25,287 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 364 transitions. [2018-09-26 08:12:25,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:12:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 364 transitions. [2018-09-26 08:12:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-09-26 08:12:25,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:25,289 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1, 1, 1] [2018-09-26 08:12:25,289 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:25,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:25,290 INFO L82 PathProgramCache]: Analyzing trace with hash 723294751, now seen corresponding path program 89 times [2018-09-26 08:12:25,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 8010 trivial. 0 not checked. [2018-09-26 08:12:25,579 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:25,579 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:12:25,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:12:25,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:12:25,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:12:25,580 INFO L87 Difference]: Start difference. First operand 363 states and 364 transitions. Second operand 92 states. [2018-09-26 08:12:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:26,011 INFO L93 Difference]: Finished difference Result 549 states and 552 transitions. [2018-09-26 08:12:26,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:12:26,011 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 362 [2018-09-26 08:12:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:26,013 INFO L225 Difference]: With dead ends: 549 [2018-09-26 08:12:26,014 INFO L226 Difference]: Without dead ends: 367 [2018-09-26 08:12:26,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:12:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-09-26 08:12:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-09-26 08:12:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-09-26 08:12:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-09-26 08:12:26,022 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 362 [2018-09-26 08:12:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:26,023 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-09-26 08:12:26,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:12:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-09-26 08:12:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-09-26 08:12:26,025 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:26,025 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1, 1, 1] [2018-09-26 08:12:26,025 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:26,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash -386433389, now seen corresponding path program 90 times [2018-09-26 08:12:26,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 8190 trivial. 0 not checked. [2018-09-26 08:12:26,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:26,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:12:26,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:12:26,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:12:26,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:12:26,450 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 93 states. [2018-09-26 08:12:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:26,913 INFO L93 Difference]: Finished difference Result 555 states and 558 transitions. [2018-09-26 08:12:26,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:12:26,913 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 366 [2018-09-26 08:12:26,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:26,915 INFO L225 Difference]: With dead ends: 555 [2018-09-26 08:12:26,915 INFO L226 Difference]: Without dead ends: 371 [2018-09-26 08:12:26,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:12:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-09-26 08:12:26,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-09-26 08:12:26,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-26 08:12:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 372 transitions. [2018-09-26 08:12:26,922 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 372 transitions. Word has length 366 [2018-09-26 08:12:26,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:26,923 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 372 transitions. [2018-09-26 08:12:26,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:12:26,923 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 372 transitions. [2018-09-26 08:12:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-09-26 08:12:26,925 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:26,925 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1, 1, 1] [2018-09-26 08:12:26,925 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:26,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:26,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2028033785, now seen corresponding path program 91 times [2018-09-26 08:12:26,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 8372 trivial. 0 not checked. [2018-09-26 08:12:27,250 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:27,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:12:27,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:12:27,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:12:27,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:12:27,252 INFO L87 Difference]: Start difference. First operand 371 states and 372 transitions. Second operand 94 states. [2018-09-26 08:12:27,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:27,939 INFO L93 Difference]: Finished difference Result 561 states and 564 transitions. [2018-09-26 08:12:27,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:12:27,939 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 370 [2018-09-26 08:12:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:27,941 INFO L225 Difference]: With dead ends: 561 [2018-09-26 08:12:27,941 INFO L226 Difference]: Without dead ends: 375 [2018-09-26 08:12:27,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:12:27,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-26 08:12:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2018-09-26 08:12:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-09-26 08:12:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2018-09-26 08:12:27,949 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 370 [2018-09-26 08:12:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:27,949 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2018-09-26 08:12:27,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:12:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2018-09-26 08:12:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-09-26 08:12:27,952 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:27,952 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1, 1, 1] [2018-09-26 08:12:27,952 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:27,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:27,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1234639227, now seen corresponding path program 92 times [2018-09-26 08:12:27,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 8556 trivial. 0 not checked. [2018-09-26 08:12:28,250 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:28,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:12:28,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:12:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:12:28,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:12:28,252 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 95 states. [2018-09-26 08:12:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:28,769 INFO L93 Difference]: Finished difference Result 567 states and 570 transitions. [2018-09-26 08:12:28,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:12:28,769 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 374 [2018-09-26 08:12:28,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:28,771 INFO L225 Difference]: With dead ends: 567 [2018-09-26 08:12:28,771 INFO L226 Difference]: Without dead ends: 379 [2018-09-26 08:12:28,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:12:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-09-26 08:12:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-09-26 08:12:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-09-26 08:12:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 380 transitions. [2018-09-26 08:12:28,780 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 380 transitions. Word has length 374 [2018-09-26 08:12:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:28,780 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 380 transitions. [2018-09-26 08:12:28,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:12:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 380 transitions. [2018-09-26 08:12:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-09-26 08:12:28,783 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:28,783 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1, 1, 1] [2018-09-26 08:12:28,784 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:28,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:28,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1676005359, now seen corresponding path program 93 times [2018-09-26 08:12:28,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 8742 trivial. 0 not checked. [2018-09-26 08:12:29,192 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:29,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:12:29,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:12:29,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:12:29,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:12:29,194 INFO L87 Difference]: Start difference. First operand 379 states and 380 transitions. Second operand 96 states. [2018-09-26 08:12:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:29,989 INFO L93 Difference]: Finished difference Result 573 states and 576 transitions. [2018-09-26 08:12:29,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:12:29,989 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 378 [2018-09-26 08:12:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:29,991 INFO L225 Difference]: With dead ends: 573 [2018-09-26 08:12:29,991 INFO L226 Difference]: Without dead ends: 383 [2018-09-26 08:12:29,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:12:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-09-26 08:12:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-09-26 08:12:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-26 08:12:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-09-26 08:12:29,998 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 378 [2018-09-26 08:12:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:29,999 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-09-26 08:12:29,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:12:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-09-26 08:12:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-09-26 08:12:30,001 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:30,002 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1, 1, 1] [2018-09-26 08:12:30,002 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:30,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:30,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1190146973, now seen corresponding path program 94 times [2018-09-26 08:12:30,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:30,463 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2018-09-26 08:12:30,463 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:30,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:12:30,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:12:30,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:12:30,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:12:30,465 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 97 states. [2018-09-26 08:12:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:30,844 INFO L93 Difference]: Finished difference Result 579 states and 582 transitions. [2018-09-26 08:12:30,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:12:30,844 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 382 [2018-09-26 08:12:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:30,846 INFO L225 Difference]: With dead ends: 579 [2018-09-26 08:12:30,846 INFO L226 Difference]: Without dead ends: 387 [2018-09-26 08:12:30,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:12:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-09-26 08:12:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-09-26 08:12:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-26 08:12:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 388 transitions. [2018-09-26 08:12:30,854 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 388 transitions. Word has length 382 [2018-09-26 08:12:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:30,855 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 388 transitions. [2018-09-26 08:12:30,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:12:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 388 transitions. [2018-09-26 08:12:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-09-26 08:12:30,857 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:30,857 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1, 1, 1] [2018-09-26 08:12:30,858 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:30,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:30,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1684402473, now seen corresponding path program 95 times [2018-09-26 08:12:30,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 9120 trivial. 0 not checked. [2018-09-26 08:12:31,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:31,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:12:31,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:12:31,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:12:31,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:12:31,190 INFO L87 Difference]: Start difference. First operand 387 states and 388 transitions. Second operand 98 states. [2018-09-26 08:12:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:31,724 INFO L93 Difference]: Finished difference Result 585 states and 588 transitions. [2018-09-26 08:12:31,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:12:31,724 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 386 [2018-09-26 08:12:31,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:31,725 INFO L225 Difference]: With dead ends: 585 [2018-09-26 08:12:31,726 INFO L226 Difference]: Without dead ends: 391 [2018-09-26 08:12:31,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:12:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-09-26 08:12:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-09-26 08:12:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-26 08:12:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2018-09-26 08:12:31,733 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 386 [2018-09-26 08:12:31,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:31,734 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2018-09-26 08:12:31,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:12:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2018-09-26 08:12:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-09-26 08:12:31,736 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:31,736 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1, 1, 1] [2018-09-26 08:12:31,736 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:31,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:31,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1920362677, now seen corresponding path program 96 times [2018-09-26 08:12:31,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 9312 trivial. 0 not checked. [2018-09-26 08:12:32,052 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:32,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:12:32,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:12:32,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:12:32,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:12:32,054 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 99 states. [2018-09-26 08:12:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:32,562 INFO L93 Difference]: Finished difference Result 591 states and 594 transitions. [2018-09-26 08:12:32,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:12:32,563 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 390 [2018-09-26 08:12:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:32,564 INFO L225 Difference]: With dead ends: 591 [2018-09-26 08:12:32,564 INFO L226 Difference]: Without dead ends: 395 [2018-09-26 08:12:32,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:12:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-26 08:12:32,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-26 08:12:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-26 08:12:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 396 transitions. [2018-09-26 08:12:32,573 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 396 transitions. Word has length 390 [2018-09-26 08:12:32,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:32,573 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 396 transitions. [2018-09-26 08:12:32,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:12:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 396 transitions. [2018-09-26 08:12:32,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-09-26 08:12:32,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:32,576 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1, 1, 1] [2018-09-26 08:12:32,576 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:32,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash 6514111, now seen corresponding path program 97 times [2018-09-26 08:12:32,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 9506 trivial. 0 not checked. [2018-09-26 08:12:32,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:32,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:12:32,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:12:32,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:12:32,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:12:32,942 INFO L87 Difference]: Start difference. First operand 395 states and 396 transitions. Second operand 100 states. [2018-09-26 08:12:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:33,398 INFO L93 Difference]: Finished difference Result 597 states and 600 transitions. [2018-09-26 08:12:33,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:12:33,399 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 394 [2018-09-26 08:12:33,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:33,400 INFO L225 Difference]: With dead ends: 597 [2018-09-26 08:12:33,400 INFO L226 Difference]: Without dead ends: 399 [2018-09-26 08:12:33,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:12:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-09-26 08:12:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-09-26 08:12:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-09-26 08:12:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-09-26 08:12:33,406 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 394 [2018-09-26 08:12:33,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:33,406 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-09-26 08:12:33,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:12:33,406 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-09-26 08:12:33,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-09-26 08:12:33,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:33,408 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1, 1, 1] [2018-09-26 08:12:33,409 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:33,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:33,409 INFO L82 PathProgramCache]: Analyzing trace with hash 355236403, now seen corresponding path program 98 times [2018-09-26 08:12:33,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2018-09-26 08:12:33,848 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:33,849 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:12:33,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:12:33,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:12:33,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:12:33,850 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 101 states. [2018-09-26 08:12:34,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:34,722 INFO L93 Difference]: Finished difference Result 603 states and 606 transitions. [2018-09-26 08:12:34,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:12:34,722 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 398 [2018-09-26 08:12:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:34,724 INFO L225 Difference]: With dead ends: 603 [2018-09-26 08:12:34,724 INFO L226 Difference]: Without dead ends: 403 [2018-09-26 08:12:34,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:12:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-09-26 08:12:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-09-26 08:12:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-26 08:12:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 404 transitions. [2018-09-26 08:12:34,731 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 404 transitions. Word has length 398 [2018-09-26 08:12:34,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:34,731 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 404 transitions. [2018-09-26 08:12:34,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:12:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 404 transitions. [2018-09-26 08:12:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-09-26 08:12:34,734 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:34,734 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1, 1, 1] [2018-09-26 08:12:34,734 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:34,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:34,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1550439591, now seen corresponding path program 99 times [2018-09-26 08:12:34,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2018-09-26 08:12:35,080 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:35,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:12:35,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:12:35,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:12:35,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:12:35,082 INFO L87 Difference]: Start difference. First operand 403 states and 404 transitions. Second operand 102 states. [2018-09-26 08:12:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:35,658 INFO L93 Difference]: Finished difference Result 609 states and 612 transitions. [2018-09-26 08:12:35,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:12:35,658 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 402 [2018-09-26 08:12:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:35,660 INFO L225 Difference]: With dead ends: 609 [2018-09-26 08:12:35,660 INFO L226 Difference]: Without dead ends: 407 [2018-09-26 08:12:35,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:12:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-09-26 08:12:35,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-09-26 08:12:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-09-26 08:12:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2018-09-26 08:12:35,669 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 402 [2018-09-26 08:12:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:35,669 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2018-09-26 08:12:35,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:12:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2018-09-26 08:12:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-09-26 08:12:35,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:35,672 INFO L375 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1, 1, 1] [2018-09-26 08:12:35,672 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:35,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:35,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1776257765, now seen corresponding path program 100 times [2018-09-26 08:12:35,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 10100 trivial. 0 not checked. [2018-09-26 08:12:36,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:36,156 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:12:36,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:12:36,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:12:36,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:12:36,158 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 103 states. [2018-09-26 08:12:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:37,087 INFO L93 Difference]: Finished difference Result 615 states and 618 transitions. [2018-09-26 08:12:37,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:12:37,087 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 406 [2018-09-26 08:12:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:37,089 INFO L225 Difference]: With dead ends: 615 [2018-09-26 08:12:37,089 INFO L226 Difference]: Without dead ends: 411 [2018-09-26 08:12:37,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:12:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-09-26 08:12:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-09-26 08:12:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-26 08:12:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2018-09-26 08:12:37,097 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 406 [2018-09-26 08:12:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:37,097 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 412 transitions. [2018-09-26 08:12:37,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:12:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 412 transitions. [2018-09-26 08:12:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-09-26 08:12:37,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:37,099 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 101, 101, 1, 1, 1, 1] [2018-09-26 08:12:37,099 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:37,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1909808015, now seen corresponding path program 101 times [2018-09-26 08:12:37,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 10302 trivial. 0 not checked. [2018-09-26 08:12:37,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:37,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:12:37,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:12:37,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:12:37,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:12:37,449 INFO L87 Difference]: Start difference. First operand 411 states and 412 transitions. Second operand 104 states. [2018-09-26 08:12:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:38,472 INFO L93 Difference]: Finished difference Result 621 states and 624 transitions. [2018-09-26 08:12:38,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:12:38,472 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 410 [2018-09-26 08:12:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:38,474 INFO L225 Difference]: With dead ends: 621 [2018-09-26 08:12:38,474 INFO L226 Difference]: Without dead ends: 415 [2018-09-26 08:12:38,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:12:38,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-09-26 08:12:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2018-09-26 08:12:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-09-26 08:12:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-09-26 08:12:38,484 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 410 [2018-09-26 08:12:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:38,484 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-09-26 08:12:38,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:12:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-09-26 08:12:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-09-26 08:12:38,487 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:38,487 INFO L375 BasicCegarLoop]: trace histogram [103, 103, 102, 102, 1, 1, 1, 1] [2018-09-26 08:12:38,487 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:38,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:38,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1317898243, now seen corresponding path program 102 times [2018-09-26 08:12:38,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 10506 trivial. 0 not checked. [2018-09-26 08:12:38,911 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:38,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:12:38,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:12:38,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:12:38,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:12:38,913 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 105 states. [2018-09-26 08:12:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:39,904 INFO L93 Difference]: Finished difference Result 627 states and 630 transitions. [2018-09-26 08:12:39,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:12:39,904 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 414 [2018-09-26 08:12:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:39,905 INFO L225 Difference]: With dead ends: 627 [2018-09-26 08:12:39,905 INFO L226 Difference]: Without dead ends: 419 [2018-09-26 08:12:39,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:12:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-09-26 08:12:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-09-26 08:12:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-09-26 08:12:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 420 transitions. [2018-09-26 08:12:39,913 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 420 transitions. Word has length 414 [2018-09-26 08:12:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:39,914 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 420 transitions. [2018-09-26 08:12:39,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:12:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 420 transitions. [2018-09-26 08:12:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-09-26 08:12:39,916 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:39,916 INFO L375 BasicCegarLoop]: trace histogram [104, 104, 103, 103, 1, 1, 1, 1] [2018-09-26 08:12:39,916 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:39,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:39,917 INFO L82 PathProgramCache]: Analyzing trace with hash -87164297, now seen corresponding path program 103 times [2018-09-26 08:12:39,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 10712 trivial. 0 not checked. [2018-09-26 08:12:40,297 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:40,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:12:40,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:12:40,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:12:40,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:12:40,299 INFO L87 Difference]: Start difference. First operand 419 states and 420 transitions. Second operand 106 states. [2018-09-26 08:12:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:41,333 INFO L93 Difference]: Finished difference Result 633 states and 636 transitions. [2018-09-26 08:12:41,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:12:41,334 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 418 [2018-09-26 08:12:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:41,335 INFO L225 Difference]: With dead ends: 633 [2018-09-26 08:12:41,335 INFO L226 Difference]: Without dead ends: 423 [2018-09-26 08:12:41,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:12:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-26 08:12:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-09-26 08:12:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-09-26 08:12:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2018-09-26 08:12:41,344 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 418 [2018-09-26 08:12:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:41,344 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2018-09-26 08:12:41,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:12:41,344 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2018-09-26 08:12:41,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-09-26 08:12:41,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:41,347 INFO L375 BasicCegarLoop]: trace histogram [105, 105, 104, 104, 1, 1, 1, 1] [2018-09-26 08:12:41,347 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:41,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1956360939, now seen corresponding path program 104 times [2018-09-26 08:12:41,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 10920 trivial. 0 not checked. [2018-09-26 08:12:41,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:41,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:12:41,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:12:41,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:12:41,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:12:41,733 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 107 states. [2018-09-26 08:12:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:42,355 INFO L93 Difference]: Finished difference Result 639 states and 642 transitions. [2018-09-26 08:12:42,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:12:42,355 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 422 [2018-09-26 08:12:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:42,356 INFO L225 Difference]: With dead ends: 639 [2018-09-26 08:12:42,356 INFO L226 Difference]: Without dead ends: 427 [2018-09-26 08:12:42,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:12:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-09-26 08:12:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-09-26 08:12:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-26 08:12:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 428 transitions. [2018-09-26 08:12:42,364 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 428 transitions. Word has length 422 [2018-09-26 08:12:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:42,365 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 428 transitions. [2018-09-26 08:12:42,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:12:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 428 transitions. [2018-09-26 08:12:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-09-26 08:12:42,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:42,367 INFO L375 BasicCegarLoop]: trace histogram [106, 106, 105, 105, 1, 1, 1, 1] [2018-09-26 08:12:42,367 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:42,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:42,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1451511457, now seen corresponding path program 105 times [2018-09-26 08:12:42,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 11130 trivial. 0 not checked. [2018-09-26 08:12:42,753 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:42,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:12:42,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:12:42,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:12:42,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:12:42,755 INFO L87 Difference]: Start difference. First operand 427 states and 428 transitions. Second operand 108 states. [2018-09-26 08:12:43,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:43,971 INFO L93 Difference]: Finished difference Result 645 states and 648 transitions. [2018-09-26 08:12:43,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:12:43,971 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 426 [2018-09-26 08:12:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:43,972 INFO L225 Difference]: With dead ends: 645 [2018-09-26 08:12:43,972 INFO L226 Difference]: Without dead ends: 431 [2018-09-26 08:12:43,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:12:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-09-26 08:12:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-09-26 08:12:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-09-26 08:12:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-09-26 08:12:43,977 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 426 [2018-09-26 08:12:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:43,978 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-09-26 08:12:43,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:12:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-09-26 08:12:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-09-26 08:12:43,979 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:43,979 INFO L375 BasicCegarLoop]: trace histogram [107, 107, 106, 106, 1, 1, 1, 1] [2018-09-26 08:12:43,979 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:43,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash 913503699, now seen corresponding path program 106 times [2018-09-26 08:12:43,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 11342 trivial. 0 not checked. [2018-09-26 08:12:44,528 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:44,528 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:12:44,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:12:44,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:12:44,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:12:44,530 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 109 states. [2018-09-26 08:12:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:45,242 INFO L93 Difference]: Finished difference Result 651 states and 654 transitions. [2018-09-26 08:12:45,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:12:45,242 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 430 [2018-09-26 08:12:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:45,243 INFO L225 Difference]: With dead ends: 651 [2018-09-26 08:12:45,243 INFO L226 Difference]: Without dead ends: 435 [2018-09-26 08:12:45,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:12:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-09-26 08:12:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-09-26 08:12:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-09-26 08:12:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 436 transitions. [2018-09-26 08:12:45,249 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 436 transitions. Word has length 430 [2018-09-26 08:12:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:45,249 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 436 transitions. [2018-09-26 08:12:45,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:12:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 436 transitions. [2018-09-26 08:12:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-09-26 08:12:45,251 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:45,252 INFO L375 BasicCegarLoop]: trace histogram [108, 108, 107, 107, 1, 1, 1, 1] [2018-09-26 08:12:45,252 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:45,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash 671514695, now seen corresponding path program 107 times [2018-09-26 08:12:45,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 11556 trivial. 0 not checked. [2018-09-26 08:12:45,650 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:45,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:12:45,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:12:45,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:12:45,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:12:45,652 INFO L87 Difference]: Start difference. First operand 435 states and 436 transitions. Second operand 110 states. [2018-09-26 08:12:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:46,542 INFO L93 Difference]: Finished difference Result 657 states and 660 transitions. [2018-09-26 08:12:46,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:12:46,542 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 434 [2018-09-26 08:12:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:46,543 INFO L225 Difference]: With dead ends: 657 [2018-09-26 08:12:46,543 INFO L226 Difference]: Without dead ends: 439 [2018-09-26 08:12:46,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:12:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-09-26 08:12:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2018-09-26 08:12:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-09-26 08:12:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-09-26 08:12:46,548 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 434 [2018-09-26 08:12:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:46,548 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-09-26 08:12:46,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:12:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-09-26 08:12:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-09-26 08:12:46,550 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:46,550 INFO L375 BasicCegarLoop]: trace histogram [109, 109, 108, 108, 1, 1, 1, 1] [2018-09-26 08:12:46,550 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:46,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1170517829, now seen corresponding path program 108 times [2018-09-26 08:12:46,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 11772 trivial. 0 not checked. [2018-09-26 08:12:46,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:46,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:12:46,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:12:46,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:12:46,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:12:46,946 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 111 states. [2018-09-26 08:12:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:47,904 INFO L93 Difference]: Finished difference Result 663 states and 666 transitions. [2018-09-26 08:12:47,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:12:47,904 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 438 [2018-09-26 08:12:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:47,905 INFO L225 Difference]: With dead ends: 663 [2018-09-26 08:12:47,905 INFO L226 Difference]: Without dead ends: 443 [2018-09-26 08:12:47,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:12:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-09-26 08:12:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-09-26 08:12:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-09-26 08:12:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 444 transitions. [2018-09-26 08:12:47,910 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 444 transitions. Word has length 438 [2018-09-26 08:12:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:47,910 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 444 transitions. [2018-09-26 08:12:47,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:12:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 444 transitions. [2018-09-26 08:12:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-09-26 08:12:47,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:47,913 INFO L375 BasicCegarLoop]: trace histogram [110, 110, 109, 109, 1, 1, 1, 1] [2018-09-26 08:12:47,913 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:47,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash 412509999, now seen corresponding path program 109 times [2018-09-26 08:12:47,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 11990 trivial. 0 not checked. [2018-09-26 08:12:48,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:48,332 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:12:48,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:12:48,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:12:48,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:12:48,334 INFO L87 Difference]: Start difference. First operand 443 states and 444 transitions. Second operand 112 states. [2018-09-26 08:12:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:49,243 INFO L93 Difference]: Finished difference Result 669 states and 672 transitions. [2018-09-26 08:12:49,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:12:49,243 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 442 [2018-09-26 08:12:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:49,244 INFO L225 Difference]: With dead ends: 669 [2018-09-26 08:12:49,244 INFO L226 Difference]: Without dead ends: 447 [2018-09-26 08:12:49,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:12:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-09-26 08:12:49,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2018-09-26 08:12:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-09-26 08:12:49,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2018-09-26 08:12:49,249 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 442 [2018-09-26 08:12:49,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:49,249 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2018-09-26 08:12:49,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:12:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2018-09-26 08:12:49,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-09-26 08:12:49,252 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:49,252 INFO L375 BasicCegarLoop]: trace histogram [111, 111, 110, 110, 1, 1, 1, 1] [2018-09-26 08:12:49,252 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:49,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:49,252 INFO L82 PathProgramCache]: Analyzing trace with hash 505201571, now seen corresponding path program 110 times [2018-09-26 08:12:49,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 24420 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 12210 trivial. 0 not checked. [2018-09-26 08:12:49,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:49,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:12:49,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:12:49,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:12:49,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:12:49,731 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 113 states. [2018-09-26 08:12:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:51,016 INFO L93 Difference]: Finished difference Result 675 states and 678 transitions. [2018-09-26 08:12:51,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:12:51,016 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 446 [2018-09-26 08:12:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:51,017 INFO L225 Difference]: With dead ends: 675 [2018-09-26 08:12:51,017 INFO L226 Difference]: Without dead ends: 451 [2018-09-26 08:12:51,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:12:51,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-09-26 08:12:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2018-09-26 08:12:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-09-26 08:12:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 452 transitions. [2018-09-26 08:12:51,025 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 452 transitions. Word has length 446 [2018-09-26 08:12:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:51,025 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 452 transitions. [2018-09-26 08:12:51,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:12:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 452 transitions. [2018-09-26 08:12:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-09-26 08:12:51,027 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:51,027 INFO L375 BasicCegarLoop]: trace histogram [112, 112, 111, 111, 1, 1, 1, 1] [2018-09-26 08:12:51,028 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:51,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash 357787159, now seen corresponding path program 111 times [2018-09-26 08:12:51,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 12432 trivial. 0 not checked. [2018-09-26 08:12:51,431 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:51,431 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:12:51,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:12:51,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:12:51,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:12:51,433 INFO L87 Difference]: Start difference. First operand 451 states and 452 transitions. Second operand 114 states. [2018-09-26 08:12:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:52,270 INFO L93 Difference]: Finished difference Result 681 states and 684 transitions. [2018-09-26 08:12:52,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:12:52,270 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 450 [2018-09-26 08:12:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:52,271 INFO L225 Difference]: With dead ends: 681 [2018-09-26 08:12:52,271 INFO L226 Difference]: Without dead ends: 455 [2018-09-26 08:12:52,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:12:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-09-26 08:12:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2018-09-26 08:12:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-09-26 08:12:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2018-09-26 08:12:52,278 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 450 [2018-09-26 08:12:52,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:52,278 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2018-09-26 08:12:52,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:12:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2018-09-26 08:12:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-09-26 08:12:52,280 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:52,280 INFO L375 BasicCegarLoop]: trace histogram [113, 113, 112, 112, 1, 1, 1, 1] [2018-09-26 08:12:52,280 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:52,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:52,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2017414795, now seen corresponding path program 112 times [2018-09-26 08:12:52,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 12656 trivial. 0 not checked. [2018-09-26 08:12:52,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:52,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:12:52,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:12:52,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:12:52,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:12:52,706 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 115 states. [2018-09-26 08:12:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:54,318 INFO L93 Difference]: Finished difference Result 687 states and 690 transitions. [2018-09-26 08:12:54,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:12:54,318 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 454 [2018-09-26 08:12:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:54,319 INFO L225 Difference]: With dead ends: 687 [2018-09-26 08:12:54,319 INFO L226 Difference]: Without dead ends: 459 [2018-09-26 08:12:54,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:12:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-09-26 08:12:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2018-09-26 08:12:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-09-26 08:12:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 460 transitions. [2018-09-26 08:12:54,327 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 460 transitions. Word has length 454 [2018-09-26 08:12:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:54,328 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 460 transitions. [2018-09-26 08:12:54,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:12:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 460 transitions. [2018-09-26 08:12:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-09-26 08:12:54,330 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:54,330 INFO L375 BasicCegarLoop]: trace histogram [114, 114, 113, 113, 1, 1, 1, 1] [2018-09-26 08:12:54,330 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:54,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:54,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1335526145, now seen corresponding path program 113 times [2018-09-26 08:12:54,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 12882 trivial. 0 not checked. [2018-09-26 08:12:54,816 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:54,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:12:54,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:12:54,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:12:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:12:54,819 INFO L87 Difference]: Start difference. First operand 459 states and 460 transitions. Second operand 116 states. [2018-09-26 08:12:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:56,261 INFO L93 Difference]: Finished difference Result 693 states and 696 transitions. [2018-09-26 08:12:56,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:12:56,261 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 458 [2018-09-26 08:12:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:56,262 INFO L225 Difference]: With dead ends: 693 [2018-09-26 08:12:56,262 INFO L226 Difference]: Without dead ends: 463 [2018-09-26 08:12:56,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:12:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-09-26 08:12:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2018-09-26 08:12:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-09-26 08:12:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2018-09-26 08:12:56,274 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 458 [2018-09-26 08:12:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:56,274 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2018-09-26 08:12:56,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:12:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2018-09-26 08:12:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-09-26 08:12:56,277 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:56,277 INFO L375 BasicCegarLoop]: trace histogram [115, 115, 114, 114, 1, 1, 1, 1] [2018-09-26 08:12:56,277 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:56,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:56,277 INFO L82 PathProgramCache]: Analyzing trace with hash -691342989, now seen corresponding path program 114 times [2018-09-26 08:12:56,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 13110 trivial. 0 not checked. [2018-09-26 08:12:56,782 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:56,782 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:12:56,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:12:56,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:12:56,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:12:56,784 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 117 states. [2018-09-26 08:12:57,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:57,857 INFO L93 Difference]: Finished difference Result 699 states and 702 transitions. [2018-09-26 08:12:57,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:12:57,857 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 462 [2018-09-26 08:12:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:57,859 INFO L225 Difference]: With dead ends: 699 [2018-09-26 08:12:57,859 INFO L226 Difference]: Without dead ends: 467 [2018-09-26 08:12:57,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:12:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-09-26 08:12:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2018-09-26 08:12:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-09-26 08:12:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 468 transitions. [2018-09-26 08:12:57,867 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 468 transitions. Word has length 462 [2018-09-26 08:12:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:57,867 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 468 transitions. [2018-09-26 08:12:57,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:12:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 468 transitions. [2018-09-26 08:12:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-09-26 08:12:57,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:57,870 INFO L375 BasicCegarLoop]: trace histogram [116, 116, 115, 115, 1, 1, 1, 1] [2018-09-26 08:12:57,870 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:57,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1945414631, now seen corresponding path program 115 times [2018-09-26 08:12:57,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 13340 trivial. 0 not checked. [2018-09-26 08:12:58,317 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:58,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:12:58,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:12:58,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:12:58,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:12:58,319 INFO L87 Difference]: Start difference. First operand 467 states and 468 transitions. Second operand 118 states. [2018-09-26 08:13:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:00,019 INFO L93 Difference]: Finished difference Result 705 states and 708 transitions. [2018-09-26 08:13:00,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:13:00,020 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 466 [2018-09-26 08:13:00,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:00,021 INFO L225 Difference]: With dead ends: 705 [2018-09-26 08:13:00,021 INFO L226 Difference]: Without dead ends: 471 [2018-09-26 08:13:00,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:13:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-09-26 08:13:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2018-09-26 08:13:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-26 08:13:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 472 transitions. [2018-09-26 08:13:00,026 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 472 transitions. Word has length 466 [2018-09-26 08:13:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:00,026 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 472 transitions. [2018-09-26 08:13:00,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:13:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 472 transitions. [2018-09-26 08:13:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-09-26 08:13:00,028 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:00,028 INFO L375 BasicCegarLoop]: trace histogram [117, 117, 116, 116, 1, 1, 1, 1] [2018-09-26 08:13:00,028 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:00,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:00,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1072147547, now seen corresponding path program 116 times [2018-09-26 08:13:00,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 27144 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 13572 trivial. 0 not checked. [2018-09-26 08:13:00,493 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:00,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:13:00,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:13:00,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:13:00,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:13:00,496 INFO L87 Difference]: Start difference. First operand 471 states and 472 transitions. Second operand 119 states. [2018-09-26 08:13:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:02,343 INFO L93 Difference]: Finished difference Result 711 states and 714 transitions. [2018-09-26 08:13:02,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:13:02,343 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 470 [2018-09-26 08:13:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:02,344 INFO L225 Difference]: With dead ends: 711 [2018-09-26 08:13:02,344 INFO L226 Difference]: Without dead ends: 475 [2018-09-26 08:13:02,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:13:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-09-26 08:13:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2018-09-26 08:13:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-09-26 08:13:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 476 transitions. [2018-09-26 08:13:02,350 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 476 transitions. Word has length 470 [2018-09-26 08:13:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:02,350 INFO L480 AbstractCegarLoop]: Abstraction has 475 states and 476 transitions. [2018-09-26 08:13:02,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:13:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 476 transitions. [2018-09-26 08:13:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-09-26 08:13:02,352 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:02,352 INFO L375 BasicCegarLoop]: trace histogram [118, 118, 117, 117, 1, 1, 1, 1] [2018-09-26 08:13:02,352 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:02,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash -500632881, now seen corresponding path program 117 times [2018-09-26 08:13:02,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 13806 trivial. 0 not checked. [2018-09-26 08:13:02,912 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:02,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:13:02,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:13:02,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:13:02,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:13:02,914 INFO L87 Difference]: Start difference. First operand 475 states and 476 transitions. Second operand 120 states. [2018-09-26 08:13:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:03,869 INFO L93 Difference]: Finished difference Result 717 states and 720 transitions. [2018-09-26 08:13:03,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:13:03,870 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 474 [2018-09-26 08:13:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:03,870 INFO L225 Difference]: With dead ends: 717 [2018-09-26 08:13:03,870 INFO L226 Difference]: Without dead ends: 479 [2018-09-26 08:13:03,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:13:03,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-09-26 08:13:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2018-09-26 08:13:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-26 08:13:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 480 transitions. [2018-09-26 08:13:03,875 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 480 transitions. Word has length 474 [2018-09-26 08:13:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:03,876 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 480 transitions. [2018-09-26 08:13:03,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:13:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 480 transitions. [2018-09-26 08:13:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-09-26 08:13:03,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:03,877 INFO L375 BasicCegarLoop]: trace histogram [119, 119, 118, 118, 1, 1, 1, 1] [2018-09-26 08:13:03,877 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:03,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1312981181, now seen corresponding path program 118 times [2018-09-26 08:13:03,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 14042 trivial. 0 not checked. [2018-09-26 08:13:04,338 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:04,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:13:04,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:13:04,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:13:04,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:13:04,340 INFO L87 Difference]: Start difference. First operand 479 states and 480 transitions. Second operand 121 states. [2018-09-26 08:13:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:05,463 INFO L93 Difference]: Finished difference Result 723 states and 726 transitions. [2018-09-26 08:13:05,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:13:05,464 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 478 [2018-09-26 08:13:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:05,465 INFO L225 Difference]: With dead ends: 723 [2018-09-26 08:13:05,465 INFO L226 Difference]: Without dead ends: 483 [2018-09-26 08:13:05,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:13:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-09-26 08:13:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2018-09-26 08:13:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-09-26 08:13:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 484 transitions. [2018-09-26 08:13:05,473 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 484 transitions. Word has length 478 [2018-09-26 08:13:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:05,474 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 484 transitions. [2018-09-26 08:13:05,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:13:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 484 transitions. [2018-09-26 08:13:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-09-26 08:13:05,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:05,476 INFO L375 BasicCegarLoop]: trace histogram [120, 120, 119, 119, 1, 1, 1, 1] [2018-09-26 08:13:05,476 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:05,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:05,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1965707703, now seen corresponding path program 119 times [2018-09-26 08:13:05,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2018-09-26 08:13:05,981 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:05,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:13:05,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:13:05,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:13:05,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:13:05,983 INFO L87 Difference]: Start difference. First operand 483 states and 484 transitions. Second operand 122 states. [2018-09-26 08:13:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:07,803 INFO L93 Difference]: Finished difference Result 729 states and 732 transitions. [2018-09-26 08:13:07,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:13:07,803 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 482 [2018-09-26 08:13:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:07,804 INFO L225 Difference]: With dead ends: 729 [2018-09-26 08:13:07,804 INFO L226 Difference]: Without dead ends: 487 [2018-09-26 08:13:07,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:13:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-09-26 08:13:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2018-09-26 08:13:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-26 08:13:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2018-09-26 08:13:07,813 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 482 [2018-09-26 08:13:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:07,813 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2018-09-26 08:13:07,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:13:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2018-09-26 08:13:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-09-26 08:13:07,816 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:07,816 INFO L375 BasicCegarLoop]: trace histogram [121, 121, 120, 120, 1, 1, 1, 1] [2018-09-26 08:13:07,816 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:07,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash 578054699, now seen corresponding path program 120 times [2018-09-26 08:13:07,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 29040 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 14520 trivial. 0 not checked. [2018-09-26 08:13:08,313 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:08,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:13:08,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:13:08,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:13:08,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:13:08,315 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 123 states. [2018-09-26 08:13:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:10,039 INFO L93 Difference]: Finished difference Result 735 states and 738 transitions. [2018-09-26 08:13:10,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:13:10,039 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 486 [2018-09-26 08:13:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:10,040 INFO L225 Difference]: With dead ends: 735 [2018-09-26 08:13:10,040 INFO L226 Difference]: Without dead ends: 491 [2018-09-26 08:13:10,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:13:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-09-26 08:13:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2018-09-26 08:13:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-09-26 08:13:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 492 transitions. [2018-09-26 08:13:10,045 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 492 transitions. Word has length 486 [2018-09-26 08:13:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:10,045 INFO L480 AbstractCegarLoop]: Abstraction has 491 states and 492 transitions. [2018-09-26 08:13:10,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:13:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 492 transitions. [2018-09-26 08:13:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-09-26 08:13:10,047 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:10,047 INFO L375 BasicCegarLoop]: trace histogram [122, 122, 121, 121, 1, 1, 1, 1] [2018-09-26 08:13:10,047 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:10,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1625241441, now seen corresponding path program 121 times [2018-09-26 08:13:10,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 14762 trivial. 0 not checked. [2018-09-26 08:13:10,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:10,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:13:10,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:13:10,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:13:10,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:13:10,526 INFO L87 Difference]: Start difference. First operand 491 states and 492 transitions. Second operand 124 states. [2018-09-26 08:13:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:12,157 INFO L93 Difference]: Finished difference Result 741 states and 744 transitions. [2018-09-26 08:13:12,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:13:12,157 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 490 [2018-09-26 08:13:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:12,158 INFO L225 Difference]: With dead ends: 741 [2018-09-26 08:13:12,158 INFO L226 Difference]: Without dead ends: 495 [2018-09-26 08:13:12,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:13:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-09-26 08:13:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2018-09-26 08:13:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-09-26 08:13:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2018-09-26 08:13:12,164 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 490 [2018-09-26 08:13:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:12,164 INFO L480 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2018-09-26 08:13:12,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:13:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2018-09-26 08:13:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-09-26 08:13:12,166 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:12,166 INFO L375 BasicCegarLoop]: trace histogram [123, 123, 122, 122, 1, 1, 1, 1] [2018-09-26 08:13:12,166 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:12,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:12,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2144047853, now seen corresponding path program 122 times [2018-09-26 08:13:12,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 15006 trivial. 0 not checked. [2018-09-26 08:13:12,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:12,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:13:12,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:13:12,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:13:12,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:13:12,651 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 125 states. [2018-09-26 08:13:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:13,704 INFO L93 Difference]: Finished difference Result 747 states and 750 transitions. [2018-09-26 08:13:13,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:13:13,704 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 494 [2018-09-26 08:13:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:13,705 INFO L225 Difference]: With dead ends: 747 [2018-09-26 08:13:13,706 INFO L226 Difference]: Without dead ends: 499 [2018-09-26 08:13:13,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:13:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-09-26 08:13:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2018-09-26 08:13:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-09-26 08:13:13,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 500 transitions. [2018-09-26 08:13:13,715 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 500 transitions. Word has length 494 [2018-09-26 08:13:13,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:13,716 INFO L480 AbstractCegarLoop]: Abstraction has 499 states and 500 transitions. [2018-09-26 08:13:13,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:13:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 500 transitions. [2018-09-26 08:13:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-09-26 08:13:13,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:13,719 INFO L375 BasicCegarLoop]: trace histogram [124, 124, 123, 123, 1, 1, 1, 1] [2018-09-26 08:13:13,719 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:13,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash -902539385, now seen corresponding path program 123 times [2018-09-26 08:13:13,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 15252 trivial. 0 not checked. [2018-09-26 08:13:14,302 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:14,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:13:14,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:13:14,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:13:14,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:13:14,305 INFO L87 Difference]: Start difference. First operand 499 states and 500 transitions. Second operand 126 states. [2018-09-26 08:13:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:16,235 INFO L93 Difference]: Finished difference Result 753 states and 756 transitions. [2018-09-26 08:13:16,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:13:16,235 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 498 [2018-09-26 08:13:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:16,237 INFO L225 Difference]: With dead ends: 753 [2018-09-26 08:13:16,237 INFO L226 Difference]: Without dead ends: 503 [2018-09-26 08:13:16,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:13:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-09-26 08:13:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2018-09-26 08:13:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-09-26 08:13:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2018-09-26 08:13:16,246 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 498 [2018-09-26 08:13:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:16,246 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2018-09-26 08:13:16,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:13:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2018-09-26 08:13:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-09-26 08:13:16,249 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:16,249 INFO L375 BasicCegarLoop]: trace histogram [125, 125, 124, 124, 1, 1, 1, 1] [2018-09-26 08:13:16,250 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:16,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:16,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1322940421, now seen corresponding path program 124 times [2018-09-26 08:13:16,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 15500 trivial. 0 not checked. [2018-09-26 08:13:16,909 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:16,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:13:16,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:13:16,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:13:16,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:13:16,912 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 127 states. [2018-09-26 08:13:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:18,692 INFO L93 Difference]: Finished difference Result 759 states and 762 transitions. [2018-09-26 08:13:18,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:13:18,692 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 502 [2018-09-26 08:13:18,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:18,693 INFO L225 Difference]: With dead ends: 759 [2018-09-26 08:13:18,693 INFO L226 Difference]: Without dead ends: 507 [2018-09-26 08:13:18,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:13:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-09-26 08:13:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2018-09-26 08:13:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-09-26 08:13:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 508 transitions. [2018-09-26 08:13:18,699 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 508 transitions. Word has length 502 [2018-09-26 08:13:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:18,699 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 508 transitions. [2018-09-26 08:13:18,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:13:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 508 transitions. [2018-09-26 08:13:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-09-26 08:13:18,702 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:18,702 INFO L375 BasicCegarLoop]: trace histogram [126, 126, 125, 125, 1, 1, 1, 1] [2018-09-26 08:13:18,703 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:18,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1485635183, now seen corresponding path program 125 times [2018-09-26 08:13:18,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 15750 trivial. 0 not checked. [2018-09-26 08:13:19,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:19,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:13:19,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:13:19,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:13:19,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:13:19,218 INFO L87 Difference]: Start difference. First operand 507 states and 508 transitions. Second operand 128 states. [2018-09-26 08:13:20,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:20,686 INFO L93 Difference]: Finished difference Result 765 states and 768 transitions. [2018-09-26 08:13:20,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:13:20,687 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 506 [2018-09-26 08:13:20,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:20,688 INFO L225 Difference]: With dead ends: 765 [2018-09-26 08:13:20,688 INFO L226 Difference]: Without dead ends: 511 [2018-09-26 08:13:20,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:13:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-26 08:13:20,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2018-09-26 08:13:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-09-26 08:13:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2018-09-26 08:13:20,697 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 506 [2018-09-26 08:13:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:20,697 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2018-09-26 08:13:20,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:13:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2018-09-26 08:13:20,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-09-26 08:13:20,700 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:20,700 INFO L375 BasicCegarLoop]: trace histogram [127, 127, 126, 126, 1, 1, 1, 1] [2018-09-26 08:13:20,700 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:20,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:20,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1821394205, now seen corresponding path program 126 times [2018-09-26 08:13:20,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 32004 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 16002 trivial. 0 not checked. [2018-09-26 08:13:21,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:21,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:13:21,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:13:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:13:21,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:13:21,311 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 129 states. [2018-09-26 08:13:23,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:23,917 INFO L93 Difference]: Finished difference Result 771 states and 774 transitions. [2018-09-26 08:13:23,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:13:23,917 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 510 [2018-09-26 08:13:23,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:23,918 INFO L225 Difference]: With dead ends: 771 [2018-09-26 08:13:23,919 INFO L226 Difference]: Without dead ends: 515 [2018-09-26 08:13:23,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:13:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-09-26 08:13:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2018-09-26 08:13:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-09-26 08:13:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 516 transitions. [2018-09-26 08:13:23,925 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 516 transitions. Word has length 510 [2018-09-26 08:13:23,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:23,925 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 516 transitions. [2018-09-26 08:13:23,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:13:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 516 transitions. [2018-09-26 08:13:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-09-26 08:13:23,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:23,927 INFO L375 BasicCegarLoop]: trace histogram [128, 128, 127, 127, 1, 1, 1, 1] [2018-09-26 08:13:23,928 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:23,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:23,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1538081449, now seen corresponding path program 127 times [2018-09-26 08:13:23,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 16256 trivial. 0 not checked. [2018-09-26 08:13:24,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:24,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:13:24,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:13:24,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:13:24,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:13:24,800 INFO L87 Difference]: Start difference. First operand 515 states and 516 transitions. Second operand 130 states. [2018-09-26 08:13:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:26,184 INFO L93 Difference]: Finished difference Result 777 states and 780 transitions. [2018-09-26 08:13:26,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:13:26,185 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 514 [2018-09-26 08:13:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:26,186 INFO L225 Difference]: With dead ends: 777 [2018-09-26 08:13:26,186 INFO L226 Difference]: Without dead ends: 519 [2018-09-26 08:13:26,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:13:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-09-26 08:13:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 519. [2018-09-26 08:13:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-09-26 08:13:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 520 transitions. [2018-09-26 08:13:26,193 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 520 transitions. Word has length 514 [2018-09-26 08:13:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:26,194 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 520 transitions. [2018-09-26 08:13:26,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:13:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 520 transitions. [2018-09-26 08:13:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-09-26 08:13:26,196 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:26,196 INFO L375 BasicCegarLoop]: trace histogram [129, 129, 128, 128, 1, 1, 1, 1] [2018-09-26 08:13:26,196 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:26,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:26,197 INFO L82 PathProgramCache]: Analyzing trace with hash -46463541, now seen corresponding path program 128 times [2018-09-26 08:13:26,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 33024 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 16512 trivial. 0 not checked. [2018-09-26 08:13:26,769 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:26,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:13:26,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:13:26,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:13:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:13:26,772 INFO L87 Difference]: Start difference. First operand 519 states and 520 transitions. Second operand 131 states. [2018-09-26 08:13:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:28,815 INFO L93 Difference]: Finished difference Result 783 states and 786 transitions. [2018-09-26 08:13:28,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:13:28,816 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 518 [2018-09-26 08:13:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:28,817 INFO L225 Difference]: With dead ends: 783 [2018-09-26 08:13:28,817 INFO L226 Difference]: Without dead ends: 523 [2018-09-26 08:13:28,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:13:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-09-26 08:13:28,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2018-09-26 08:13:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-09-26 08:13:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 524 transitions. [2018-09-26 08:13:28,826 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 524 transitions. Word has length 518 [2018-09-26 08:13:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:28,827 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 524 transitions. [2018-09-26 08:13:28,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:13:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 524 transitions. [2018-09-26 08:13:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-09-26 08:13:28,829 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:28,830 INFO L375 BasicCegarLoop]: trace histogram [130, 130, 129, 129, 1, 1, 1, 1] [2018-09-26 08:13:28,830 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:28,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash -5401537, now seen corresponding path program 129 times [2018-09-26 08:13:28,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 33540 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 16770 trivial. 0 not checked. [2018-09-26 08:13:29,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:29,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:13:29,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:13:29,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:13:29,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:13:29,451 INFO L87 Difference]: Start difference. First operand 523 states and 524 transitions. Second operand 132 states. [2018-09-26 08:13:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:31,915 INFO L93 Difference]: Finished difference Result 789 states and 792 transitions. [2018-09-26 08:13:31,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:13:31,915 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 522 [2018-09-26 08:13:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:31,916 INFO L225 Difference]: With dead ends: 789 [2018-09-26 08:13:31,916 INFO L226 Difference]: Without dead ends: 527 [2018-09-26 08:13:31,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:13:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-09-26 08:13:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-09-26 08:13:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-09-26 08:13:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 528 transitions. [2018-09-26 08:13:31,921 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 528 transitions. Word has length 522 [2018-09-26 08:13:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:31,922 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 528 transitions. [2018-09-26 08:13:31,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:13:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2018-09-26 08:13:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2018-09-26 08:13:31,923 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:31,924 INFO L375 BasicCegarLoop]: trace histogram [131, 131, 130, 130, 1, 1, 1, 1] [2018-09-26 08:13:31,924 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:31,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:31,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1129355085, now seen corresponding path program 130 times [2018-09-26 08:13:31,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 17030 trivial. 0 not checked. [2018-09-26 08:13:32,480 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:32,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:13:32,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:13:32,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:13:32,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:13:32,483 INFO L87 Difference]: Start difference. First operand 527 states and 528 transitions. Second operand 133 states. [2018-09-26 08:13:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:33,968 INFO L93 Difference]: Finished difference Result 795 states and 798 transitions. [2018-09-26 08:13:33,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:13:33,968 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 526 [2018-09-26 08:13:33,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:33,969 INFO L225 Difference]: With dead ends: 795 [2018-09-26 08:13:33,969 INFO L226 Difference]: Without dead ends: 531 [2018-09-26 08:13:33,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:13:33,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-09-26 08:13:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2018-09-26 08:13:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-09-26 08:13:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 532 transitions. [2018-09-26 08:13:33,975 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 532 transitions. Word has length 526 [2018-09-26 08:13:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:33,975 INFO L480 AbstractCegarLoop]: Abstraction has 531 states and 532 transitions. [2018-09-26 08:13:33,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:13:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 532 transitions. [2018-09-26 08:13:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-09-26 08:13:33,977 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:33,977 INFO L375 BasicCegarLoop]: trace histogram [132, 132, 131, 131, 1, 1, 1, 1] [2018-09-26 08:13:33,977 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:33,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:33,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1262124249, now seen corresponding path program 131 times [2018-09-26 08:13:33,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 34584 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 17292 trivial. 0 not checked. [2018-09-26 08:13:34,553 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:34,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:13:34,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:13:34,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:13:34,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:13:34,557 INFO L87 Difference]: Start difference. First operand 531 states and 532 transitions. Second operand 134 states. [2018-09-26 08:13:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:36,071 INFO L93 Difference]: Finished difference Result 801 states and 804 transitions. [2018-09-26 08:13:36,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:13:36,071 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 530 [2018-09-26 08:13:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:36,072 INFO L225 Difference]: With dead ends: 801 [2018-09-26 08:13:36,072 INFO L226 Difference]: Without dead ends: 535 [2018-09-26 08:13:36,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:13:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-09-26 08:13:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-09-26 08:13:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-09-26 08:13:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2018-09-26 08:13:36,081 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 530 [2018-09-26 08:13:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:36,081 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2018-09-26 08:13:36,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:13:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2018-09-26 08:13:36,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-09-26 08:13:36,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:36,085 INFO L375 BasicCegarLoop]: trace histogram [133, 133, 132, 132, 1, 1, 1, 1] [2018-09-26 08:13:36,085 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:36,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:36,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1745558629, now seen corresponding path program 132 times [2018-09-26 08:13:36,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 35112 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 17556 trivial. 0 not checked. [2018-09-26 08:13:36,839 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:36,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:13:36,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:13:36,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:13:36,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:13:36,841 INFO L87 Difference]: Start difference. First operand 535 states and 536 transitions. Second operand 135 states. [2018-09-26 08:13:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:38,338 INFO L93 Difference]: Finished difference Result 807 states and 810 transitions. [2018-09-26 08:13:38,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:13:38,338 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 534 [2018-09-26 08:13:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:38,339 INFO L225 Difference]: With dead ends: 807 [2018-09-26 08:13:38,339 INFO L226 Difference]: Without dead ends: 539 [2018-09-26 08:13:38,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:13:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-09-26 08:13:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2018-09-26 08:13:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-09-26 08:13:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 540 transitions. [2018-09-26 08:13:38,345 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 540 transitions. Word has length 534 [2018-09-26 08:13:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:38,345 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 540 transitions. [2018-09-26 08:13:38,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:13:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 540 transitions. [2018-09-26 08:13:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-09-26 08:13:38,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:38,347 INFO L375 BasicCegarLoop]: trace histogram [134, 134, 133, 133, 1, 1, 1, 1] [2018-09-26 08:13:38,348 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:38,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:38,348 INFO L82 PathProgramCache]: Analyzing trace with hash 96635407, now seen corresponding path program 133 times [2018-09-26 08:13:38,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 17822 trivial. 0 not checked. [2018-09-26 08:13:38,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:38,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:13:38,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:13:38,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:13:38,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:13:38,936 INFO L87 Difference]: Start difference. First operand 539 states and 540 transitions. Second operand 136 states. [2018-09-26 08:13:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:40,491 INFO L93 Difference]: Finished difference Result 813 states and 816 transitions. [2018-09-26 08:13:40,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:13:40,491 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 538 [2018-09-26 08:13:40,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:40,491 INFO L225 Difference]: With dead ends: 813 [2018-09-26 08:13:40,492 INFO L226 Difference]: Without dead ends: 543 [2018-09-26 08:13:40,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:13:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-09-26 08:13:40,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2018-09-26 08:13:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-09-26 08:13:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 544 transitions. [2018-09-26 08:13:40,498 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 544 transitions. Word has length 538 [2018-09-26 08:13:40,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:40,498 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 544 transitions. [2018-09-26 08:13:40,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:13:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 544 transitions. [2018-09-26 08:13:40,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-09-26 08:13:40,500 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:40,500 INFO L375 BasicCegarLoop]: trace histogram [135, 135, 134, 134, 1, 1, 1, 1] [2018-09-26 08:13:40,500 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:40,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:40,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1295218307, now seen corresponding path program 134 times [2018-09-26 08:13:40,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 36180 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 18090 trivial. 0 not checked. [2018-09-26 08:13:41,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:41,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:13:41,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:13:41,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:13:41,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:13:41,139 INFO L87 Difference]: Start difference. First operand 543 states and 544 transitions. Second operand 137 states. [2018-09-26 08:13:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:42,886 INFO L93 Difference]: Finished difference Result 819 states and 822 transitions. [2018-09-26 08:13:42,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:13:42,886 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 542 [2018-09-26 08:13:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:42,887 INFO L225 Difference]: With dead ends: 819 [2018-09-26 08:13:42,887 INFO L226 Difference]: Without dead ends: 547 [2018-09-26 08:13:42,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:13:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-09-26 08:13:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2018-09-26 08:13:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-09-26 08:13:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 548 transitions. [2018-09-26 08:13:42,894 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 548 transitions. Word has length 542 [2018-09-26 08:13:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:42,894 INFO L480 AbstractCegarLoop]: Abstraction has 547 states and 548 transitions. [2018-09-26 08:13:42,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:13:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 548 transitions. [2018-09-26 08:13:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-09-26 08:13:42,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:42,896 INFO L375 BasicCegarLoop]: trace histogram [136, 136, 135, 135, 1, 1, 1, 1] [2018-09-26 08:13:42,896 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:42,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:42,897 INFO L82 PathProgramCache]: Analyzing trace with hash 751610103, now seen corresponding path program 135 times [2018-09-26 08:13:42,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 36720 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 18360 trivial. 0 not checked. [2018-09-26 08:13:43,557 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:43,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:13:43,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:13:43,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:13:43,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:13:43,559 INFO L87 Difference]: Start difference. First operand 547 states and 548 transitions. Second operand 138 states. [2018-09-26 08:13:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:46,731 INFO L93 Difference]: Finished difference Result 825 states and 828 transitions. [2018-09-26 08:13:46,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:13:46,732 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 546 [2018-09-26 08:13:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:46,732 INFO L225 Difference]: With dead ends: 825 [2018-09-26 08:13:46,732 INFO L226 Difference]: Without dead ends: 551 [2018-09-26 08:13:46,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:13:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2018-09-26 08:13:46,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2018-09-26 08:13:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-09-26 08:13:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2018-09-26 08:13:46,738 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 546 [2018-09-26 08:13:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:46,739 INFO L480 AbstractCegarLoop]: Abstraction has 551 states and 552 transitions. [2018-09-26 08:13:46,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:13:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 552 transitions. [2018-09-26 08:13:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-09-26 08:13:46,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:46,741 INFO L375 BasicCegarLoop]: trace histogram [137, 137, 136, 136, 1, 1, 1, 1] [2018-09-26 08:13:46,741 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:46,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:46,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1835851413, now seen corresponding path program 136 times [2018-09-26 08:13:46,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 37264 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 18632 trivial. 0 not checked. [2018-09-26 08:13:47,344 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:47,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-09-26 08:13:47,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-09-26 08:13:47,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-09-26 08:13:47,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:13:47,347 INFO L87 Difference]: Start difference. First operand 551 states and 552 transitions. Second operand 139 states. [2018-09-26 08:13:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:50,173 INFO L93 Difference]: Finished difference Result 831 states and 834 transitions. [2018-09-26 08:13:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:13:50,173 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 550 [2018-09-26 08:13:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:50,173 INFO L225 Difference]: With dead ends: 831 [2018-09-26 08:13:50,173 INFO L226 Difference]: Without dead ends: 555 [2018-09-26 08:13:50,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:13:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-09-26 08:13:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2018-09-26 08:13:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-26 08:13:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 556 transitions. [2018-09-26 08:13:50,183 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 556 transitions. Word has length 550 [2018-09-26 08:13:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:50,183 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 556 transitions. [2018-09-26 08:13:50,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-09-26 08:13:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 556 transitions. [2018-09-26 08:13:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2018-09-26 08:13:50,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:50,186 INFO L375 BasicCegarLoop]: trace histogram [138, 138, 137, 137, 1, 1, 1, 1] [2018-09-26 08:13:50,186 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:50,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:50,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1544282079, now seen corresponding path program 137 times [2018-09-26 08:13:50,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 37812 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 18906 trivial. 0 not checked. [2018-09-26 08:13:50,866 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:50,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:13:50,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:13:50,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:13:50,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:13:50,870 INFO L87 Difference]: Start difference. First operand 555 states and 556 transitions. Second operand 140 states. [2018-09-26 08:13:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:52,510 INFO L93 Difference]: Finished difference Result 837 states and 840 transitions. [2018-09-26 08:13:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:13:52,510 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 554 [2018-09-26 08:13:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:52,511 INFO L225 Difference]: With dead ends: 837 [2018-09-26 08:13:52,511 INFO L226 Difference]: Without dead ends: 559 [2018-09-26 08:13:52,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:13:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-09-26 08:13:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2018-09-26 08:13:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-09-26 08:13:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 560 transitions. [2018-09-26 08:13:52,516 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 560 transitions. Word has length 554 [2018-09-26 08:13:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:52,516 INFO L480 AbstractCegarLoop]: Abstraction has 559 states and 560 transitions. [2018-09-26 08:13:52,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:13:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 560 transitions. [2018-09-26 08:13:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-09-26 08:13:52,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:52,519 INFO L375 BasicCegarLoop]: trace histogram [139, 139, 138, 138, 1, 1, 1, 1] [2018-09-26 08:13:52,519 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:52,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash 373023827, now seen corresponding path program 138 times [2018-09-26 08:13:52,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 38364 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 19182 trivial. 0 not checked. [2018-09-26 08:13:53,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:53,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:13:53,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:13:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:13:53,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:13:53,132 INFO L87 Difference]: Start difference. First operand 559 states and 560 transitions. Second operand 141 states. [2018-09-26 08:13:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:56,489 INFO L93 Difference]: Finished difference Result 843 states and 846 transitions. [2018-09-26 08:13:56,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:13:56,489 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 558 [2018-09-26 08:13:56,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:56,490 INFO L225 Difference]: With dead ends: 843 [2018-09-26 08:13:56,490 INFO L226 Difference]: Without dead ends: 563 [2018-09-26 08:13:56,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:13:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-09-26 08:13:56,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2018-09-26 08:13:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-09-26 08:13:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 564 transitions. [2018-09-26 08:13:56,497 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 564 transitions. Word has length 558 [2018-09-26 08:13:56,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:56,497 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 564 transitions. [2018-09-26 08:13:56,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:13:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 564 transitions. [2018-09-26 08:13:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-09-26 08:13:56,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:56,499 INFO L375 BasicCegarLoop]: trace histogram [140, 140, 139, 139, 1, 1, 1, 1] [2018-09-26 08:13:56,500 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:56,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:56,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1113051449, now seen corresponding path program 139 times [2018-09-26 08:13:56,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 38920 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 19460 trivial. 0 not checked. [2018-09-26 08:13:57,142 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:57,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:13:57,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:13:57,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:13:57,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:13:57,145 INFO L87 Difference]: Start difference. First operand 563 states and 564 transitions. Second operand 142 states. [2018-09-26 08:13:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:59,083 INFO L93 Difference]: Finished difference Result 849 states and 852 transitions. [2018-09-26 08:13:59,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:13:59,083 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 562 [2018-09-26 08:13:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:59,084 INFO L225 Difference]: With dead ends: 849 [2018-09-26 08:13:59,084 INFO L226 Difference]: Without dead ends: 567 [2018-09-26 08:13:59,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:13:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-09-26 08:13:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2018-09-26 08:13:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-09-26 08:13:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2018-09-26 08:13:59,090 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 562 [2018-09-26 08:13:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:59,091 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2018-09-26 08:13:59,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:13:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2018-09-26 08:13:59,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2018-09-26 08:13:59,093 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:59,093 INFO L375 BasicCegarLoop]: trace histogram [141, 141, 140, 140, 1, 1, 1, 1] [2018-09-26 08:13:59,093 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:59,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:59,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2119548731, now seen corresponding path program 140 times [2018-09-26 08:13:59,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 39480 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 19740 trivial. 0 not checked. [2018-09-26 08:13:59,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:59,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-09-26 08:13:59,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-26 08:13:59,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-26 08:13:59,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:13:59,794 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 143 states. [2018-09-26 08:14:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:02,967 INFO L93 Difference]: Finished difference Result 855 states and 858 transitions. [2018-09-26 08:14:02,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:14:02,967 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 566 [2018-09-26 08:14:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:02,968 INFO L225 Difference]: With dead ends: 855 [2018-09-26 08:14:02,968 INFO L226 Difference]: Without dead ends: 571 [2018-09-26 08:14:02,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:14:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-09-26 08:14:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2018-09-26 08:14:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-09-26 08:14:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 572 transitions. [2018-09-26 08:14:02,973 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 572 transitions. Word has length 566 [2018-09-26 08:14:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:02,974 INFO L480 AbstractCegarLoop]: Abstraction has 571 states and 572 transitions. [2018-09-26 08:14:02,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-26 08:14:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 572 transitions. [2018-09-26 08:14:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-09-26 08:14:02,976 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:02,976 INFO L375 BasicCegarLoop]: trace histogram [142, 142, 141, 141, 1, 1, 1, 1] [2018-09-26 08:14:02,976 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:02,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:02,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1942590895, now seen corresponding path program 141 times [2018-09-26 08:14:02,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 40044 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 20022 trivial. 0 not checked. [2018-09-26 08:14:03,738 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:03,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:14:03,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:14:03,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:14:03,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:14:03,741 INFO L87 Difference]: Start difference. First operand 571 states and 572 transitions. Second operand 144 states. [2018-09-26 08:14:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:08,022 INFO L93 Difference]: Finished difference Result 861 states and 864 transitions. [2018-09-26 08:14:08,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:14:08,023 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 570 [2018-09-26 08:14:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:08,023 INFO L225 Difference]: With dead ends: 861 [2018-09-26 08:14:08,023 INFO L226 Difference]: Without dead ends: 575 [2018-09-26 08:14:08,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:14:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-09-26 08:14:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2018-09-26 08:14:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-09-26 08:14:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2018-09-26 08:14:08,029 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 570 [2018-09-26 08:14:08,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:08,030 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2018-09-26 08:14:08,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:14:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2018-09-26 08:14:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2018-09-26 08:14:08,032 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:08,032 INFO L375 BasicCegarLoop]: trace histogram [143, 143, 142, 142, 1, 1, 1, 1] [2018-09-26 08:14:08,032 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:08,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:08,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1762177571, now seen corresponding path program 142 times [2018-09-26 08:14:08,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 40612 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 20306 trivial. 0 not checked. [2018-09-26 08:14:08,770 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:08,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:14:08,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:14:08,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:14:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:14:08,772 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 145 states. [2018-09-26 08:14:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:10,623 INFO L93 Difference]: Finished difference Result 867 states and 870 transitions. [2018-09-26 08:14:10,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:14:10,623 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 574 [2018-09-26 08:14:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:10,624 INFO L225 Difference]: With dead ends: 867 [2018-09-26 08:14:10,624 INFO L226 Difference]: Without dead ends: 579 [2018-09-26 08:14:10,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:14:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-09-26 08:14:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2018-09-26 08:14:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-09-26 08:14:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 580 transitions. [2018-09-26 08:14:10,630 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 580 transitions. Word has length 574 [2018-09-26 08:14:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:10,631 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 580 transitions. [2018-09-26 08:14:10,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:14:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 580 transitions. [2018-09-26 08:14:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2018-09-26 08:14:10,633 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:10,633 INFO L375 BasicCegarLoop]: trace histogram [144, 144, 143, 143, 1, 1, 1, 1] [2018-09-26 08:14:10,633 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:10,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1734863721, now seen corresponding path program 143 times [2018-09-26 08:14:10,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 41184 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 20592 trivial. 0 not checked. [2018-09-26 08:14:11,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:11,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:14:11,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:14:11,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:14:11,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:14:11,301 INFO L87 Difference]: Start difference. First operand 579 states and 580 transitions. Second operand 146 states. [2018-09-26 08:14:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:13,636 INFO L93 Difference]: Finished difference Result 873 states and 876 transitions. [2018-09-26 08:14:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:14:13,636 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 578 [2018-09-26 08:14:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:13,637 INFO L225 Difference]: With dead ends: 873 [2018-09-26 08:14:13,637 INFO L226 Difference]: Without dead ends: 583 [2018-09-26 08:14:13,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:14:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-09-26 08:14:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2018-09-26 08:14:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-09-26 08:14:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2018-09-26 08:14:13,643 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 578 [2018-09-26 08:14:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:13,644 INFO L480 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2018-09-26 08:14:13,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:14:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2018-09-26 08:14:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-09-26 08:14:13,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:13,646 INFO L375 BasicCegarLoop]: trace histogram [145, 145, 144, 144, 1, 1, 1, 1] [2018-09-26 08:14:13,646 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:13,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:13,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1820114187, now seen corresponding path program 144 times [2018-09-26 08:14:13,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 41760 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 20880 trivial. 0 not checked. [2018-09-26 08:14:14,382 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:14,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-09-26 08:14:14,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-09-26 08:14:14,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-09-26 08:14:14,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:14:14,384 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 147 states. [2018-09-26 08:14:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:16,852 INFO L93 Difference]: Finished difference Result 879 states and 882 transitions. [2018-09-26 08:14:16,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:14:16,853 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 582 [2018-09-26 08:14:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:16,853 INFO L225 Difference]: With dead ends: 879 [2018-09-26 08:14:16,853 INFO L226 Difference]: Without dead ends: 587 [2018-09-26 08:14:16,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:14:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-09-26 08:14:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2018-09-26 08:14:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-09-26 08:14:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 588 transitions. [2018-09-26 08:14:16,859 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 588 transitions. Word has length 582 [2018-09-26 08:14:16,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:16,859 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 588 transitions. [2018-09-26 08:14:16,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-09-26 08:14:16,859 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 588 transitions. [2018-09-26 08:14:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-09-26 08:14:16,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:16,862 INFO L375 BasicCegarLoop]: trace histogram [146, 146, 145, 145, 1, 1, 1, 1] [2018-09-26 08:14:16,862 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:16,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:16,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1044097919, now seen corresponding path program 145 times [2018-09-26 08:14:16,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 42340 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 21170 trivial. 0 not checked. [2018-09-26 08:14:17,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:17,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:14:17,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:14:17,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:14:17,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:14:17,566 INFO L87 Difference]: Start difference. First operand 587 states and 588 transitions. Second operand 148 states. [2018-09-26 08:14:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:20,184 INFO L93 Difference]: Finished difference Result 885 states and 888 transitions. [2018-09-26 08:14:20,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:14:20,184 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 586 [2018-09-26 08:14:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:20,185 INFO L225 Difference]: With dead ends: 885 [2018-09-26 08:14:20,185 INFO L226 Difference]: Without dead ends: 591 [2018-09-26 08:14:20,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:14:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-09-26 08:14:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2018-09-26 08:14:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-09-26 08:14:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 592 transitions. [2018-09-26 08:14:20,192 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 592 transitions. Word has length 586 [2018-09-26 08:14:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:20,192 INFO L480 AbstractCegarLoop]: Abstraction has 591 states and 592 transitions. [2018-09-26 08:14:20,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:14:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 592 transitions. [2018-09-26 08:14:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-09-26 08:14:20,194 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:20,194 INFO L375 BasicCegarLoop]: trace histogram [147, 147, 146, 146, 1, 1, 1, 1] [2018-09-26 08:14:20,194 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:20,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:20,195 INFO L82 PathProgramCache]: Analyzing trace with hash 383377395, now seen corresponding path program 146 times [2018-09-26 08:14:20,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 42924 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 21462 trivial. 0 not checked. [2018-09-26 08:14:20,916 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:20,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:14:20,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:14:20,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:14:20,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:14:20,919 INFO L87 Difference]: Start difference. First operand 591 states and 592 transitions. Second operand 149 states. [2018-09-26 08:14:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:23,025 INFO L93 Difference]: Finished difference Result 891 states and 894 transitions. [2018-09-26 08:14:23,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:14:23,026 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 590 [2018-09-26 08:14:23,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:23,026 INFO L225 Difference]: With dead ends: 891 [2018-09-26 08:14:23,026 INFO L226 Difference]: Without dead ends: 595 [2018-09-26 08:14:23,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:14:23,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-09-26 08:14:23,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2018-09-26 08:14:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-09-26 08:14:23,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 596 transitions. [2018-09-26 08:14:23,032 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 596 transitions. Word has length 590 [2018-09-26 08:14:23,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:23,032 INFO L480 AbstractCegarLoop]: Abstraction has 595 states and 596 transitions. [2018-09-26 08:14:23,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:14:23,033 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 596 transitions. [2018-09-26 08:14:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2018-09-26 08:14:23,035 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:23,035 INFO L375 BasicCegarLoop]: trace histogram [148, 148, 147, 147, 1, 1, 1, 1] [2018-09-26 08:14:23,035 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:23,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:23,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1859934823, now seen corresponding path program 147 times [2018-09-26 08:14:23,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 43512 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 21756 trivial. 0 not checked. [2018-09-26 08:14:23,756 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:23,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:14:23,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:14:23,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:14:23,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:14:23,760 INFO L87 Difference]: Start difference. First operand 595 states and 596 transitions. Second operand 150 states. [2018-09-26 08:14:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:27,290 INFO L93 Difference]: Finished difference Result 897 states and 900 transitions. [2018-09-26 08:14:27,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:14:27,290 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 594 [2018-09-26 08:14:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:27,291 INFO L225 Difference]: With dead ends: 897 [2018-09-26 08:14:27,291 INFO L226 Difference]: Without dead ends: 599 [2018-09-26 08:14:27,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:14:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-09-26 08:14:27,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2018-09-26 08:14:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-09-26 08:14:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 600 transitions. [2018-09-26 08:14:27,299 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 600 transitions. Word has length 594 [2018-09-26 08:14:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:27,299 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 600 transitions. [2018-09-26 08:14:27,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:14:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 600 transitions. [2018-09-26 08:14:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-09-26 08:14:27,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:27,302 INFO L375 BasicCegarLoop]: trace histogram [149, 149, 148, 148, 1, 1, 1, 1] [2018-09-26 08:14:27,302 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:27,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:27,302 INFO L82 PathProgramCache]: Analyzing trace with hash -297264421, now seen corresponding path program 148 times [2018-09-26 08:14:27,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 44104 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 22052 trivial. 0 not checked. [2018-09-26 08:14:28,075 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:28,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-09-26 08:14:28,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-26 08:14:28,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-26 08:14:28,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:14:28,077 INFO L87 Difference]: Start difference. First operand 599 states and 600 transitions. Second operand 151 states. [2018-09-26 08:14:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:32,164 INFO L93 Difference]: Finished difference Result 903 states and 906 transitions. [2018-09-26 08:14:32,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:14:32,164 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 598 [2018-09-26 08:14:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:32,165 INFO L225 Difference]: With dead ends: 903 [2018-09-26 08:14:32,165 INFO L226 Difference]: Without dead ends: 603 [2018-09-26 08:14:32,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:14:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-09-26 08:14:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2018-09-26 08:14:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-09-26 08:14:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 604 transitions. [2018-09-26 08:14:32,171 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 604 transitions. Word has length 598 [2018-09-26 08:14:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:32,171 INFO L480 AbstractCegarLoop]: Abstraction has 603 states and 604 transitions. [2018-09-26 08:14:32,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-26 08:14:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 604 transitions. [2018-09-26 08:14:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-09-26 08:14:32,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:32,173 INFO L375 BasicCegarLoop]: trace histogram [150, 150, 149, 149, 1, 1, 1, 1] [2018-09-26 08:14:32,174 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:32,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash 748822863, now seen corresponding path program 149 times [2018-09-26 08:14:32,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 44700 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 22350 trivial. 0 not checked. [2018-09-26 08:14:32,921 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:32,921 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:14:32,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:14:32,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:14:32,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:14:32,924 INFO L87 Difference]: Start difference. First operand 603 states and 604 transitions. Second operand 152 states. [2018-09-26 08:14:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:36,544 INFO L93 Difference]: Finished difference Result 909 states and 912 transitions. [2018-09-26 08:14:36,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:14:36,544 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 602 [2018-09-26 08:14:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:36,545 INFO L225 Difference]: With dead ends: 909 [2018-09-26 08:14:36,545 INFO L226 Difference]: Without dead ends: 607 [2018-09-26 08:14:36,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:14:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-09-26 08:14:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2018-09-26 08:14:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-09-26 08:14:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 608 transitions. [2018-09-26 08:14:36,551 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 608 transitions. Word has length 602 [2018-09-26 08:14:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:36,551 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 608 transitions. [2018-09-26 08:14:36,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:14:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 608 transitions. [2018-09-26 08:14:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-09-26 08:14:36,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:36,554 INFO L375 BasicCegarLoop]: trace histogram [151, 151, 150, 150, 1, 1, 1, 1] [2018-09-26 08:14:36,554 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:36,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:36,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1894739395, now seen corresponding path program 150 times [2018-09-26 08:14:36,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 45300 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 22650 trivial. 0 not checked. [2018-09-26 08:14:37,330 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:37,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-09-26 08:14:37,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-09-26 08:14:37,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-09-26 08:14:37,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:14:37,332 INFO L87 Difference]: Start difference. First operand 607 states and 608 transitions. Second operand 153 states. [2018-09-26 08:14:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:41,721 INFO L93 Difference]: Finished difference Result 915 states and 918 transitions. [2018-09-26 08:14:41,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:14:41,722 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 606 [2018-09-26 08:14:41,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:41,722 INFO L225 Difference]: With dead ends: 915 [2018-09-26 08:14:41,722 INFO L226 Difference]: Without dead ends: 611 [2018-09-26 08:14:41,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:14:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-09-26 08:14:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2018-09-26 08:14:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-09-26 08:14:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 612 transitions. [2018-09-26 08:14:41,728 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 612 transitions. Word has length 606 [2018-09-26 08:14:41,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:41,728 INFO L480 AbstractCegarLoop]: Abstraction has 611 states and 612 transitions. [2018-09-26 08:14:41,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-09-26 08:14:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 612 transitions. [2018-09-26 08:14:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2018-09-26 08:14:41,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:41,731 INFO L375 BasicCegarLoop]: trace histogram [152, 152, 151, 151, 1, 1, 1, 1] [2018-09-26 08:14:41,731 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:41,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1907687479, now seen corresponding path program 151 times [2018-09-26 08:14:41,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 45904 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 22952 trivial. 0 not checked. [2018-09-26 08:14:42,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:42,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:14:42,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:14:42,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:14:42,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:14:42,481 INFO L87 Difference]: Start difference. First operand 611 states and 612 transitions. Second operand 154 states. [2018-09-26 08:14:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:46,805 INFO L93 Difference]: Finished difference Result 921 states and 924 transitions. [2018-09-26 08:14:46,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:14:46,806 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 610 [2018-09-26 08:14:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:46,807 INFO L225 Difference]: With dead ends: 921 [2018-09-26 08:14:46,807 INFO L226 Difference]: Without dead ends: 615 [2018-09-26 08:14:46,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:14:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-09-26 08:14:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2018-09-26 08:14:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-09-26 08:14:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 616 transitions. [2018-09-26 08:14:46,814 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 616 transitions. Word has length 610 [2018-09-26 08:14:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:46,814 INFO L480 AbstractCegarLoop]: Abstraction has 615 states and 616 transitions. [2018-09-26 08:14:46,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:14:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 616 transitions. [2018-09-26 08:14:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2018-09-26 08:14:46,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:46,817 INFO L375 BasicCegarLoop]: trace histogram [153, 153, 152, 152, 1, 1, 1, 1] [2018-09-26 08:14:46,817 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:46,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:46,817 INFO L82 PathProgramCache]: Analyzing trace with hash 351787179, now seen corresponding path program 152 times [2018-09-26 08:14:46,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 46512 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 23256 trivial. 0 not checked. [2018-09-26 08:14:47,619 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:47,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-09-26 08:14:47,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-09-26 08:14:47,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-09-26 08:14:47,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:14:47,622 INFO L87 Difference]: Start difference. First operand 615 states and 616 transitions. Second operand 155 states. [2018-09-26 08:14:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:53,188 INFO L93 Difference]: Finished difference Result 927 states and 930 transitions. [2018-09-26 08:14:53,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:14:53,188 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 614 [2018-09-26 08:14:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:53,189 INFO L225 Difference]: With dead ends: 927 [2018-09-26 08:14:53,189 INFO L226 Difference]: Without dead ends: 619 [2018-09-26 08:14:53,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:14:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-09-26 08:14:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2018-09-26 08:14:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-09-26 08:14:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 620 transitions. [2018-09-26 08:14:53,197 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 620 transitions. Word has length 614 [2018-09-26 08:14:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:53,198 INFO L480 AbstractCegarLoop]: Abstraction has 619 states and 620 transitions. [2018-09-26 08:14:53,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-09-26 08:14:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 620 transitions. [2018-09-26 08:14:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-09-26 08:14:53,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:53,200 INFO L375 BasicCegarLoop]: trace histogram [154, 154, 153, 153, 1, 1, 1, 1] [2018-09-26 08:14:53,201 INFO L423 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:53,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:53,201 INFO L82 PathProgramCache]: Analyzing trace with hash 809301791, now seen corresponding path program 153 times [2018-09-26 08:14:53,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 47124 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 23562 trivial. 0 not checked. [2018-09-26 08:14:54,039 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:54,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:14:54,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:14:54,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:14:54,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:14:54,041 INFO L87 Difference]: Start difference. First operand 619 states and 620 transitions. Second operand 156 states. [2018-09-26 08:14:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:56,588 INFO L93 Difference]: Finished difference Result 933 states and 936 transitions. [2018-09-26 08:14:56,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:14:56,588 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 618 [2018-09-26 08:14:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:56,589 INFO L225 Difference]: With dead ends: 933 [2018-09-26 08:14:56,589 INFO L226 Difference]: Without dead ends: 623 [2018-09-26 08:14:56,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:14:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-09-26 08:14:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2018-09-26 08:14:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-09-26 08:14:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 624 transitions. [2018-09-26 08:14:56,596 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 624 transitions. Word has length 618 [2018-09-26 08:14:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:56,596 INFO L480 AbstractCegarLoop]: Abstraction has 623 states and 624 transitions. [2018-09-26 08:14:56,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:14:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 624 transitions. [2018-09-26 08:14:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-09-26 08:14:56,599 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:56,599 INFO L375 BasicCegarLoop]: trace histogram [155, 155, 154, 154, 1, 1, 1, 1] [2018-09-26 08:14:56,599 INFO L423 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:56,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:56,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1216961427, now seen corresponding path program 154 times [2018-09-26 08:14:56,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 47740 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 23870 trivial. 0 not checked. [2018-09-26 08:14:57,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:57,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-09-26 08:14:57,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-09-26 08:14:57,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-09-26 08:14:57,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:14:57,406 INFO L87 Difference]: Start difference. First operand 623 states and 624 transitions. Second operand 157 states. [2018-09-26 08:15:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:01,367 INFO L93 Difference]: Finished difference Result 939 states and 942 transitions. [2018-09-26 08:15:01,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:15:01,367 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 622 [2018-09-26 08:15:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:01,368 INFO L225 Difference]: With dead ends: 939 [2018-09-26 08:15:01,368 INFO L226 Difference]: Without dead ends: 627 [2018-09-26 08:15:01,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:15:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-09-26 08:15:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2018-09-26 08:15:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-09-26 08:15:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 628 transitions. [2018-09-26 08:15:01,376 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 628 transitions. Word has length 622 [2018-09-26 08:15:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:01,376 INFO L480 AbstractCegarLoop]: Abstraction has 627 states and 628 transitions. [2018-09-26 08:15:01,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-09-26 08:15:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 628 transitions. [2018-09-26 08:15:01,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2018-09-26 08:15:01,378 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:01,379 INFO L375 BasicCegarLoop]: trace histogram [156, 156, 155, 155, 1, 1, 1, 1] [2018-09-26 08:15:01,379 INFO L423 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:01,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:01,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1382155783, now seen corresponding path program 155 times [2018-09-26 08:15:01,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 48360 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 24180 trivial. 0 not checked. [2018-09-26 08:15:02,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:02,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-09-26 08:15:02,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-09-26 08:15:02,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-09-26 08:15:02,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:15:02,227 INFO L87 Difference]: Start difference. First operand 627 states and 628 transitions. Second operand 158 states. [2018-09-26 08:15:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:06,964 INFO L93 Difference]: Finished difference Result 945 states and 948 transitions. [2018-09-26 08:15:06,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:15:06,964 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 626 [2018-09-26 08:15:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:06,965 INFO L225 Difference]: With dead ends: 945 [2018-09-26 08:15:06,965 INFO L226 Difference]: Without dead ends: 631 [2018-09-26 08:15:06,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:15:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-09-26 08:15:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2018-09-26 08:15:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-09-26 08:15:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 632 transitions. [2018-09-26 08:15:06,971 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 632 transitions. Word has length 626 [2018-09-26 08:15:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:06,971 INFO L480 AbstractCegarLoop]: Abstraction has 631 states and 632 transitions. [2018-09-26 08:15:06,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-09-26 08:15:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 632 transitions. [2018-09-26 08:15:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2018-09-26 08:15:06,975 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:06,975 INFO L375 BasicCegarLoop]: trace histogram [157, 157, 156, 156, 1, 1, 1, 1] [2018-09-26 08:15:06,975 INFO L423 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:06,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1909192315, now seen corresponding path program 156 times [2018-09-26 08:15:06,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 48984 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 24492 trivial. 0 not checked. [2018-09-26 08:15:07,818 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:07,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-09-26 08:15:07,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-09-26 08:15:07,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-09-26 08:15:07,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:15:07,820 INFO L87 Difference]: Start difference. First operand 631 states and 632 transitions. Second operand 159 states. [2018-09-26 08:15:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:12,705 INFO L93 Difference]: Finished difference Result 951 states and 954 transitions. [2018-09-26 08:15:12,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:15:12,705 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 630 [2018-09-26 08:15:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:12,706 INFO L225 Difference]: With dead ends: 951 [2018-09-26 08:15:12,706 INFO L226 Difference]: Without dead ends: 635 [2018-09-26 08:15:12,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:15:12,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-09-26 08:15:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2018-09-26 08:15:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-09-26 08:15:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 636 transitions. [2018-09-26 08:15:12,713 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 636 transitions. Word has length 630 [2018-09-26 08:15:12,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:12,714 INFO L480 AbstractCegarLoop]: Abstraction has 635 states and 636 transitions. [2018-09-26 08:15:12,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-09-26 08:15:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 636 transitions. [2018-09-26 08:15:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2018-09-26 08:15:12,716 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:12,717 INFO L375 BasicCegarLoop]: trace histogram [158, 158, 157, 157, 1, 1, 1, 1] [2018-09-26 08:15:12,717 INFO L423 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:12,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:12,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1169412881, now seen corresponding path program 157 times [2018-09-26 08:15:12,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 49612 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 24806 trivial. 0 not checked. [2018-09-26 08:15:13,547 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:13,547 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:15:13,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:15:13,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:15:13,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:15:13,551 INFO L87 Difference]: Start difference. First operand 635 states and 636 transitions. Second operand 160 states. [2018-09-26 08:15:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:19,400 INFO L93 Difference]: Finished difference Result 957 states and 960 transitions. [2018-09-26 08:15:19,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:15:19,401 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 634 [2018-09-26 08:15:19,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:19,402 INFO L225 Difference]: With dead ends: 957 [2018-09-26 08:15:19,402 INFO L226 Difference]: Without dead ends: 639 [2018-09-26 08:15:19,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:15:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-09-26 08:15:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2018-09-26 08:15:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-09-26 08:15:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 640 transitions. [2018-09-26 08:15:19,409 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 640 transitions. Word has length 634 [2018-09-26 08:15:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:19,409 INFO L480 AbstractCegarLoop]: Abstraction has 639 states and 640 transitions. [2018-09-26 08:15:19,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:15:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 640 transitions. [2018-09-26 08:15:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2018-09-26 08:15:19,412 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:19,412 INFO L375 BasicCegarLoop]: trace histogram [159, 159, 158, 158, 1, 1, 1, 1] [2018-09-26 08:15:19,412 INFO L423 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:19,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -286807709, now seen corresponding path program 158 times [2018-09-26 08:15:19,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 50244 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 25122 trivial. 0 not checked. [2018-09-26 08:15:20,280 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:20,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-09-26 08:15:20,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-09-26 08:15:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-09-26 08:15:20,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:15:20,284 INFO L87 Difference]: Start difference. First operand 639 states and 640 transitions. Second operand 161 states. [2018-09-26 08:15:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:25,489 INFO L93 Difference]: Finished difference Result 963 states and 966 transitions. [2018-09-26 08:15:25,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:15:25,489 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 638 [2018-09-26 08:15:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:25,491 INFO L225 Difference]: With dead ends: 963 [2018-09-26 08:15:25,491 INFO L226 Difference]: Without dead ends: 643 [2018-09-26 08:15:25,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:15:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-09-26 08:15:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2018-09-26 08:15:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-09-26 08:15:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 644 transitions. [2018-09-26 08:15:25,498 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 644 transitions. Word has length 638 [2018-09-26 08:15:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:25,499 INFO L480 AbstractCegarLoop]: Abstraction has 643 states and 644 transitions. [2018-09-26 08:15:25,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-09-26 08:15:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 644 transitions. [2018-09-26 08:15:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2018-09-26 08:15:25,501 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:25,501 INFO L375 BasicCegarLoop]: trace histogram [160, 160, 159, 159, 1, 1, 1, 1] [2018-09-26 08:15:25,502 INFO L423 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:25,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:25,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1109617623, now seen corresponding path program 159 times [2018-09-26 08:15:25,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 50880 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 25440 trivial. 0 not checked. [2018-09-26 08:15:26,383 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:26,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-09-26 08:15:26,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-09-26 08:15:26,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-09-26 08:15:26,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:15:26,386 INFO L87 Difference]: Start difference. First operand 643 states and 644 transitions. Second operand 162 states. [2018-09-26 08:15:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:29,593 INFO L93 Difference]: Finished difference Result 969 states and 972 transitions. [2018-09-26 08:15:29,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:15:29,593 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 642 [2018-09-26 08:15:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:29,594 INFO L225 Difference]: With dead ends: 969 [2018-09-26 08:15:29,594 INFO L226 Difference]: Without dead ends: 647 [2018-09-26 08:15:29,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:15:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-09-26 08:15:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2018-09-26 08:15:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-09-26 08:15:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 648 transitions. [2018-09-26 08:15:29,600 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 648 transitions. Word has length 642 [2018-09-26 08:15:29,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:29,601 INFO L480 AbstractCegarLoop]: Abstraction has 647 states and 648 transitions. [2018-09-26 08:15:29,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-09-26 08:15:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 648 transitions. [2018-09-26 08:15:29,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2018-09-26 08:15:29,603 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:29,603 INFO L375 BasicCegarLoop]: trace histogram [161, 161, 160, 160, 1, 1, 1, 1] [2018-09-26 08:15:29,603 INFO L423 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:29,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:29,603 INFO L82 PathProgramCache]: Analyzing trace with hash 369390667, now seen corresponding path program 160 times [2018-09-26 08:15:29,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 51520 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 25760 trivial. 0 not checked. [2018-09-26 08:15:30,515 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:30,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-09-26 08:15:30,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-09-26 08:15:30,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-09-26 08:15:30,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:15:30,517 INFO L87 Difference]: Start difference. First operand 647 states and 648 transitions. Second operand 163 states. [2018-09-26 08:15:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:34,316 INFO L93 Difference]: Finished difference Result 975 states and 978 transitions. [2018-09-26 08:15:34,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:15:34,316 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 646 [2018-09-26 08:15:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:34,317 INFO L225 Difference]: With dead ends: 975 [2018-09-26 08:15:34,317 INFO L226 Difference]: Without dead ends: 651 [2018-09-26 08:15:34,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:15:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-09-26 08:15:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2018-09-26 08:15:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-09-26 08:15:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 652 transitions. [2018-09-26 08:15:34,324 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 652 transitions. Word has length 646 [2018-09-26 08:15:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:34,324 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 652 transitions. [2018-09-26 08:15:34,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-09-26 08:15:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 652 transitions. [2018-09-26 08:15:34,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2018-09-26 08:15:34,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:34,327 INFO L375 BasicCegarLoop]: trace histogram [162, 162, 161, 161, 1, 1, 1, 1] [2018-09-26 08:15:34,328 INFO L423 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:34,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1139817793, now seen corresponding path program 161 times [2018-09-26 08:15:34,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 52164 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 26082 trivial. 0 not checked. [2018-09-26 08:15:35,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:35,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:15:35,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:15:35,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:15:35,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:15:35,227 INFO L87 Difference]: Start difference. First operand 651 states and 652 transitions. Second operand 164 states. [2018-09-26 08:15:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:41,089 INFO L93 Difference]: Finished difference Result 981 states and 984 transitions. [2018-09-26 08:15:41,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:15:41,090 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 650 [2018-09-26 08:15:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:41,090 INFO L225 Difference]: With dead ends: 981 [2018-09-26 08:15:41,091 INFO L226 Difference]: Without dead ends: 655 [2018-09-26 08:15:41,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:15:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-09-26 08:15:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2018-09-26 08:15:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-09-26 08:15:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 656 transitions. [2018-09-26 08:15:41,097 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 656 transitions. Word has length 650 [2018-09-26 08:15:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:41,097 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 656 transitions. [2018-09-26 08:15:41,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:15:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 656 transitions. [2018-09-26 08:15:41,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2018-09-26 08:15:41,100 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:41,100 INFO L375 BasicCegarLoop]: trace histogram [163, 163, 162, 162, 1, 1, 1, 1] [2018-09-26 08:15:41,100 INFO L423 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:41,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:41,101 INFO L82 PathProgramCache]: Analyzing trace with hash 894064435, now seen corresponding path program 162 times [2018-09-26 08:15:41,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 52812 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 26406 trivial. 0 not checked. [2018-09-26 08:15:42,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:42,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-09-26 08:15:42,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-09-26 08:15:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-09-26 08:15:42,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:15:42,031 INFO L87 Difference]: Start difference. First operand 655 states and 656 transitions. Second operand 165 states. [2018-09-26 08:15:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:45,206 INFO L93 Difference]: Finished difference Result 987 states and 990 transitions. [2018-09-26 08:15:45,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:15:45,206 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 654 [2018-09-26 08:15:45,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:45,207 INFO L225 Difference]: With dead ends: 987 [2018-09-26 08:15:45,207 INFO L226 Difference]: Without dead ends: 659 [2018-09-26 08:15:45,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:15:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-09-26 08:15:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2018-09-26 08:15:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-09-26 08:15:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 660 transitions. [2018-09-26 08:15:45,214 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 660 transitions. Word has length 654 [2018-09-26 08:15:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:45,214 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 660 transitions. [2018-09-26 08:15:45,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-09-26 08:15:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 660 transitions. [2018-09-26 08:15:45,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2018-09-26 08:15:45,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:45,217 INFO L375 BasicCegarLoop]: trace histogram [164, 164, 163, 163, 1, 1, 1, 1] [2018-09-26 08:15:45,217 INFO L423 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:45,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:45,218 INFO L82 PathProgramCache]: Analyzing trace with hash -231132761, now seen corresponding path program 163 times [2018-09-26 08:15:45,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 53464 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 26732 trivial. 0 not checked. [2018-09-26 08:15:46,176 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:46,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-09-26 08:15:46,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-09-26 08:15:46,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-09-26 08:15:46,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:15:46,181 INFO L87 Difference]: Start difference. First operand 659 states and 660 transitions. Second operand 166 states. [2018-09-26 08:15:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:52,150 INFO L93 Difference]: Finished difference Result 993 states and 996 transitions. [2018-09-26 08:15:52,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:15:52,151 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 658 [2018-09-26 08:15:52,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:52,151 INFO L225 Difference]: With dead ends: 993 [2018-09-26 08:15:52,151 INFO L226 Difference]: Without dead ends: 663 [2018-09-26 08:15:52,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:15:52,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-09-26 08:15:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2018-09-26 08:15:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-09-26 08:15:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 664 transitions. [2018-09-26 08:15:52,158 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 664 transitions. Word has length 658 [2018-09-26 08:15:52,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:52,158 INFO L480 AbstractCegarLoop]: Abstraction has 663 states and 664 transitions. [2018-09-26 08:15:52,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-09-26 08:15:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 664 transitions. [2018-09-26 08:15:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-09-26 08:15:52,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:52,161 INFO L375 BasicCegarLoop]: trace histogram [165, 165, 164, 164, 1, 1, 1, 1] [2018-09-26 08:15:52,161 INFO L423 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:52,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:52,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1830727141, now seen corresponding path program 164 times [2018-09-26 08:15:52,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 54120 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 27060 trivial. 0 not checked. [2018-09-26 08:15:53,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:53,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-09-26 08:15:53,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-09-26 08:15:53,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-09-26 08:15:53,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:15:53,083 INFO L87 Difference]: Start difference. First operand 663 states and 664 transitions. Second operand 167 states. [2018-09-26 08:15:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:56,169 INFO L93 Difference]: Finished difference Result 999 states and 1002 transitions. [2018-09-26 08:15:56,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:15:56,170 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 662 [2018-09-26 08:15:56,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:56,171 INFO L225 Difference]: With dead ends: 999 [2018-09-26 08:15:56,171 INFO L226 Difference]: Without dead ends: 667 [2018-09-26 08:15:56,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:15:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-09-26 08:15:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2018-09-26 08:15:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-09-26 08:15:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 668 transitions. [2018-09-26 08:15:56,181 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 668 transitions. Word has length 662 [2018-09-26 08:15:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:56,181 INFO L480 AbstractCegarLoop]: Abstraction has 667 states and 668 transitions. [2018-09-26 08:15:56,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-09-26 08:15:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 668 transitions. [2018-09-26 08:15:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2018-09-26 08:15:56,185 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:56,185 INFO L375 BasicCegarLoop]: trace histogram [166, 166, 165, 165, 1, 1, 1, 1] [2018-09-26 08:15:56,185 INFO L423 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:56,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:56,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1496860529, now seen corresponding path program 165 times [2018-09-26 08:15:56,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 54780 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 27390 trivial. 0 not checked. [2018-09-26 08:15:57,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:57,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:15:57,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:15:57,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:15:57,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:15:57,135 INFO L87 Difference]: Start difference. First operand 667 states and 668 transitions. Second operand 168 states. Received shutdown request... [2018-09-26 08:16:01,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:16:01,997 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:16:02,002 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:16:02,003 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:16:02 BoogieIcfgContainer [2018-09-26 08:16:02,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:16:02,003 INFO L168 Benchmark]: Toolchain (without parser) took 256480.56 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 854.6 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -512.1 MB). Peak memory consumption was 342.5 MB. Max. memory is 7.1 GB. [2018-09-26 08:16:02,005 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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:16:02,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.69 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:16:02,005 INFO L168 Benchmark]: Boogie Preprocessor took 24.41 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:16:02,006 INFO L168 Benchmark]: RCFGBuilder took 282.46 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:16:02,006 INFO L168 Benchmark]: TraceAbstraction took 256117.95 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 854.6 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -522.7 MB). Peak memory consumption was 331.9 MB. Max. memory is 7.1 GB. [2018-09-26 08:16:02,008 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.25 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 48.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.41 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 282.46 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 256117.95 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 854.6 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -522.7 MB). Peak memory consumption was 331.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 56). Cancelled while BasicCegarLoop was constructing difference of abstraction (667states) and FLOYD_HOARE automaton (currently 168 states, 168 states before enhancement), while ReachableStatesComputation was computing reachable states (920 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 256.0s OverallTime, 166 OverallIterations, 166 TraceHistogramMax, 188.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 994 SDtfs, 32336 SDslu, 33078 SDs, 0 SdLazy, 33410 SolverSat, 32893 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14027 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 13861 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=667occurred in iteration=165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 165 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 7.0s SatisfiabilityAnalysisTime, 45.7s InterpolantComputationTime, 55776 NumberOfCodeBlocks, 55776 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 55610 ConstructedInterpolants, 0 QuantifiedInterpolants, 49400770 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 166 InterpolantComputations, 1 PerfectInterpolantSequences, 1524710/3049420 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/array3.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-16-02-021.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/array3.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-16-02-021.csv Completed graceful shutdown