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/jain_5.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:16:25,293 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:16:25,295 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:16:25,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:16:25,309 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:16:25,310 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:16:25,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:16:25,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:16:25,315 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:16:25,316 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:16:25,317 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:16:25,317 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:16:25,318 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:16:25,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:16:25,320 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:16:25,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:16:25,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:16:25,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:16:25,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:16:25,328 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:16:25,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:16:25,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:16:25,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:16:25,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:16:25,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:16:25,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:16:25,340 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:16:25,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:16:25,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:16:25,346 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:16:25,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:16:25,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:16:25,351 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:16:25,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:16:25,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:16:25,355 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:16:25,355 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:16:25,365 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:16:25,365 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:16:25,367 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:16:25,367 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:16:25,367 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:16:25,367 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:16:25,368 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:16:25,368 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:16:25,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:16:25,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:16:25,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:16:25,444 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:16:25,444 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:16:25,445 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/jain_5.i_2.bpl [2018-09-26 08:16:25,446 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/jain_5.i_2.bpl' [2018-09-26 08:16:25,504 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:16:25,508 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:16:25,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:16:25,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:16:25,509 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:16:25,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:25" (1/1) ... [2018-09-26 08:16:25,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:25" (1/1) ... [2018-09-26 08:16:25,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:16:25,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:16:25,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:16:25,554 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:16:25,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:25" (1/1) ... [2018-09-26 08:16:25,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:25" (1/1) ... [2018-09-26 08:16:25,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:25" (1/1) ... [2018-09-26 08:16:25,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:25" (1/1) ... [2018-09-26 08:16:25,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:25" (1/1) ... [2018-09-26 08:16:25,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:25" (1/1) ... [2018-09-26 08:16:25,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:25" (1/1) ... [2018-09-26 08:16:25,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:16:25,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:16:25,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:16:25,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:16:25,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:25" (1/1) ... [2018-09-26 08:16:25,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:16:25,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:16:25,838 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:16:25,839 INFO L202 PluginConnector]: Adding new model jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:16:25 BoogieIcfgContainer [2018-09-26 08:16:25,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:16:25,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:16:25,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:16:25,845 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:16:25,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:25" (1/2) ... [2018-09-26 08:16:25,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23228a97 and model type jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:16:25, skipping insertion in model container [2018-09-26 08:16:25,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:16:25" (2/2) ... [2018-09-26 08:16:25,851 INFO L112 eAbstractionObserver]: Analyzing ICFG jain_5.i_2.bpl [2018-09-26 08:16:25,864 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:16:25,874 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:16:25,926 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:16:25,927 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:16:25,928 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:16:25,928 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:16:25,928 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:16:25,928 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:16:25,929 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:16:25,929 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:16:25,929 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:16:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:16:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:16:25,955 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:25,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:16:25,958 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:25,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:25,966 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2018-09-26 08:16:25,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:26,101 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:16:26,103 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:16:26,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:16:26,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:16:26,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:16:26,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:16:26,124 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-09-26 08:16:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:26,167 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-09-26 08:16:26,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:16:26,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:16:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:26,180 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:16:26,181 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:16:26,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:16:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:16:26,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-09-26 08:16:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:16:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:16:26,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-26 08:16:26,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:26,224 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:16:26,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:16:26,226 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:16:26,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:16:26,226 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:26,226 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-26 08:16:26,227 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:26,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:26,227 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2018-09-26 08:16:26,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:26,332 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:26,332 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:16:26,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:16:26,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:16:26,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:16:26,335 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-09-26 08:16:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:26,420 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:16:26,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:16:26,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:16:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:26,421 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:16:26,421 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:16:26,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:16:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:16:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:16:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:16:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:16:26,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-26 08:16:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:26,428 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:16:26,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:16:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:16:26,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:16:26,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:26,429 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-26 08:16:26,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:26,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:26,430 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2018-09-26 08:16:26,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:26,522 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:26,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:16:26,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:16:26,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:16:26,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:16:26,524 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-09-26 08:16:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:26,613 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:16:26,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:16:26,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:16:26,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:26,614 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:16:26,614 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:16:26,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:16:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:16:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:16:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:16:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:16:26,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-26 08:16:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:26,621 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:16:26,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:16:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:16:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:16:26,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:26,622 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-26 08:16:26,622 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:26,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:26,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1596122631, now seen corresponding path program 3 times [2018-09-26 08:16:26,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:26,727 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:26,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:16:26,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:16:26,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:16:26,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:16:26,731 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-09-26 08:16:26,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:26,837 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:16:26,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:16:26,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 08:16:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:26,838 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:16:26,839 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:16:26,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:16:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:16:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:16:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:16:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:16:26,846 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-26 08:16:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:26,847 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:16:26,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:16:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:16:26,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:16:26,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:26,848 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-26 08:16:26,848 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:26,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:26,849 INFO L82 PathProgramCache]: Analyzing trace with hash -570590731, now seen corresponding path program 4 times [2018-09-26 08:16:26,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:26,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:26,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:16:26,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:16:26,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:16:26,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:16:26,968 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2018-09-26 08:16:27,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:27,103 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:16:27,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:16:27,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:16:27,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:27,105 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:16:27,105 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:16:27,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:16:27,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:16:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:16:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:16:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:16:27,113 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-26 08:16:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:27,114 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:16:27,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:16:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:16:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:16:27,115 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:27,115 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-26 08:16:27,115 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:27,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:27,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1418054385, now seen corresponding path program 5 times [2018-09-26 08:16:27,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:27,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:27,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:16:27,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:16:27,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:16:27,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:16:27,190 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2018-09-26 08:16:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:27,292 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:16:27,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:16:27,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-09-26 08:16:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:27,294 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:16:27,294 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:16:27,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:16:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:16:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:16:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:16:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:16:27,301 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-26 08:16:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:27,302 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:16:27,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:16:27,302 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:16:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:16:27,303 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:27,303 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-26 08:16:27,304 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:27,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:27,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1245564141, now seen corresponding path program 6 times [2018-09-26 08:16:27,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:27,392 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:27,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:16:27,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:16:27,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:16:27,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:16:27,393 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2018-09-26 08:16:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:27,519 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:16:27,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:16:27,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-09-26 08:16:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:27,520 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:16:27,521 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:16:27,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:16:27,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:16:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:16:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:16:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:16:27,531 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-09-26 08:16:27,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:27,532 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:16:27,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:16:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:16:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:16:27,533 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:27,533 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-09-26 08:16:27,534 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:27,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:27,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1308803095, now seen corresponding path program 7 times [2018-09-26 08:16:27,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:27,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:27,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:16:27,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:16:27,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:16:27,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:16:27,643 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2018-09-26 08:16:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:27,807 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:16:27,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:16:27,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-09-26 08:16:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:27,808 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:16:27,809 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:16:27,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:16:27,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:16:27,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:16:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:16:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:16:27,823 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-09-26 08:16:27,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:27,824 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:16:27,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:16:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:16:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:16:27,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:27,827 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-09-26 08:16:27,830 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:27,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:27,831 INFO L82 PathProgramCache]: Analyzing trace with hash 665576421, now seen corresponding path program 8 times [2018-09-26 08:16:27,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:27,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:27,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:16:27,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:16:27,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:16:27,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:16:27,955 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2018-09-26 08:16:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:28,151 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:16:28,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:16:28,152 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-09-26 08:16:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:28,153 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:16:28,153 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:16:28,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:16:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:16:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:16:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:16:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:16:28,162 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-09-26 08:16:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:28,162 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:16:28,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:16:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:16:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:16:28,164 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:28,164 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-09-26 08:16:28,164 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:28,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:28,165 INFO L82 PathProgramCache]: Analyzing trace with hash -331253535, now seen corresponding path program 9 times [2018-09-26 08:16:28,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:28,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:28,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:16:28,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:16:28,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:16:28,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:16:28,292 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2018-09-26 08:16:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:28,504 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:16:28,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:16:28,505 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-09-26 08:16:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:28,506 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:16:28,506 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:16:28,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:16:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:16:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:16:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:16:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:16:28,521 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-09-26 08:16:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:28,522 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:16:28,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:16:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:16:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:16:28,523 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:28,523 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-09-26 08:16:28,524 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:28,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:28,524 INFO L82 PathProgramCache]: Analyzing trace with hash -507134243, now seen corresponding path program 10 times [2018-09-26 08:16:28,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:28,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:28,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:16:28,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:16:28,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:16:28,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:16:28,678 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 15 states. [2018-09-26 08:16:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:28,930 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:16:28,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:16:28,930 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-09-26 08:16:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:28,931 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:16:28,931 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:16:28,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:16:28,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:16:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:16:28,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:16:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:16:28,942 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-09-26 08:16:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:28,942 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:16:28,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:16:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:16:28,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:16:28,943 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:28,944 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-09-26 08:16:28,944 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:28,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:28,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2024770087, now seen corresponding path program 11 times [2018-09-26 08:16:28,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:29,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:29,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:16:29,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:16:29,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:16:29,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:16:29,070 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 16 states. [2018-09-26 08:16:29,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:29,312 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:16:29,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:16:29,313 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-09-26 08:16:29,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:29,314 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:16:29,314 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:16:29,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:16:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:16:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:16:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:16:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:16:29,329 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-09-26 08:16:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:29,330 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:16:29,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:16:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:16:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:16:29,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:29,331 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-09-26 08:16:29,332 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:29,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:29,332 INFO L82 PathProgramCache]: Analyzing trace with hash -183935531, now seen corresponding path program 12 times [2018-09-26 08:16:29,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:29,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:29,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:16:29,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:16:29,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:16:29,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:16:29,475 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2018-09-26 08:16:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:29,738 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:16:29,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:16:29,738 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-09-26 08:16:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:29,739 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:16:29,739 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:16:29,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:16:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:16:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:16:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:16:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:16:29,755 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-09-26 08:16:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:29,756 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:16:29,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:16:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:16:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:16:29,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:29,760 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-09-26 08:16:29,760 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:29,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:29,761 INFO L82 PathProgramCache]: Analyzing trace with hash -668453167, now seen corresponding path program 13 times [2018-09-26 08:16:29,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:29,924 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:29,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:16:29,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:16:29,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:16:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:16:29,954 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2018-09-26 08:16:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:30,254 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:16:30,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:16:30,254 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-09-26 08:16:30,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:30,255 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:16:30,255 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:16:30,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:16:30,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:16:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:16:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:16:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:16:30,268 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-09-26 08:16:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:30,268 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:16:30,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:16:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:16:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:16:30,270 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:30,270 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-09-26 08:16:30,270 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:30,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1861533901, now seen corresponding path program 14 times [2018-09-26 08:16:30,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:30,427 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:30,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:16:30,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:16:30,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:16:30,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:16:30,428 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 19 states. [2018-09-26 08:16:30,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:30,767 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:16:30,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:16:30,768 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-09-26 08:16:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:30,768 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:16:30,768 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:16:30,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:16:30,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:16:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:16:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:16:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:16:30,787 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-09-26 08:16:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:30,787 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:16:30,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:16:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:16:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:16:30,794 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:30,794 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-09-26 08:16:30,794 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:30,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:30,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2067350583, now seen corresponding path program 15 times [2018-09-26 08:16:30,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:30,979 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:30,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:16:30,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:16:30,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:16:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:16:30,983 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 20 states. [2018-09-26 08:16:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:31,328 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:16:31,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:16:31,330 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2018-09-26 08:16:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:31,331 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:16:31,331 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:16:31,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:16:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:16:31,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:16:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:16:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:16:31,345 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-09-26 08:16:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:31,346 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:16:31,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:16:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:16:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:16:31,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:31,347 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-09-26 08:16:31,347 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:31,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:31,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1845880773, now seen corresponding path program 16 times [2018-09-26 08:16:31,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:31,513 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:31,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:31,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:16:31,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:16:31,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:16:31,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:16:31,514 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 21 states. [2018-09-26 08:16:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:31,854 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:16:31,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:16:31,855 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-09-26 08:16:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:31,856 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:16:31,856 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:16:31,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:16:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:16:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:16:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:16:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:16:31,872 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-09-26 08:16:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:31,873 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:16:31,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:16:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:16:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:16:31,874 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:31,874 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-09-26 08:16:31,874 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:31,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash 69862593, now seen corresponding path program 17 times [2018-09-26 08:16:31,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:32,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:32,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:16:32,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:16:32,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:16:32,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:16:32,071 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 22 states. [2018-09-26 08:16:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:32,486 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:16:32,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:16:32,486 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-09-26 08:16:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:32,487 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:16:32,487 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:16:32,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:16:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:16:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:16:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:16:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:16:32,512 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-09-26 08:16:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:32,512 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:16:32,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:16:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:16:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:16:32,514 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:32,514 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-09-26 08:16:32,514 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:32,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:32,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1581591875, now seen corresponding path program 18 times [2018-09-26 08:16:32,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:32,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:32,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:16:32,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:16:32,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:16:32,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:16:32,746 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 23 states. [2018-09-26 08:16:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:33,209 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:16:33,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:16:33,209 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2018-09-26 08:16:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:33,210 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:16:33,210 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:16:33,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:16:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:16:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:16:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:16:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:16:33,228 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-09-26 08:16:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:33,228 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:16:33,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:16:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:16:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:16:33,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:33,229 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-09-26 08:16:33,229 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:33,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:33,230 INFO L82 PathProgramCache]: Analyzing trace with hash 508563897, now seen corresponding path program 19 times [2018-09-26 08:16:33,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:33,404 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:33,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:16:33,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:16:33,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:16:33,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:16:33,406 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 24 states. [2018-09-26 08:16:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:33,836 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:16:33,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:16:33,836 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-09-26 08:16:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:33,837 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:16:33,837 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:16:33,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:16:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:16:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:16:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:16:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:16:33,865 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-09-26 08:16:33,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:33,865 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:16:33,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:16:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:16:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:16:33,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:33,866 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-09-26 08:16:33,867 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:33,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:33,867 INFO L82 PathProgramCache]: Analyzing trace with hash -896433739, now seen corresponding path program 20 times [2018-09-26 08:16:33,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:34,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:34,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:16:34,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:16:34,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:16:34,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:16:34,081 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 25 states. [2018-09-26 08:16:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:34,571 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:16:34,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:16:34,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2018-09-26 08:16:34,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:34,572 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:16:34,572 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:16:34,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:16:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:16:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:16:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:16:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:16:34,592 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-09-26 08:16:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:34,593 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:16:34,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:16:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:16:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:16:34,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:34,594 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-09-26 08:16:34,594 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:34,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1815536305, now seen corresponding path program 21 times [2018-09-26 08:16:34,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:34,806 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:34,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:16:34,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:16:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:16:34,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:16:34,808 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 26 states. [2018-09-26 08:16:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:35,324 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:16:35,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:16:35,325 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-09-26 08:16:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:35,325 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:16:35,326 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:16:35,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:16:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:16:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:16:35,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:16:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:16:35,348 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-09-26 08:16:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:35,349 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:16:35,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:16:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:16:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:16:35,350 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:35,350 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-09-26 08:16:35,350 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:35,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash 973599917, now seen corresponding path program 22 times [2018-09-26 08:16:35,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:35,610 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:35,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:16:35,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:16:35,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:16:35,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:16:35,612 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 27 states. [2018-09-26 08:16:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:36,198 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:16:36,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:16:36,198 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2018-09-26 08:16:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:36,199 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:16:36,199 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:16:36,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:16:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:16:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:16:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:16:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:16:36,222 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-09-26 08:16:36,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:36,222 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:16:36,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:16:36,222 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:16:36,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:16:36,223 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:36,223 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-09-26 08:16:36,223 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:36,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash -673417303, now seen corresponding path program 23 times [2018-09-26 08:16:36,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:36,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:36,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:16:36,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:16:36,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:16:36,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:16:36,460 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 28 states. [2018-09-26 08:16:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:37,004 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:16:37,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:16:37,004 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2018-09-26 08:16:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:37,005 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:16:37,005 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:16:37,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:16:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:16:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:16:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:16:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:16:37,030 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-09-26 08:16:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:37,031 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:16:37,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:16:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:16:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:16:37,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:37,032 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-09-26 08:16:37,032 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:37,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:37,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1385966501, now seen corresponding path program 24 times [2018-09-26 08:16:37,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:37,288 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:37,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:16:37,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:16:37,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:16:37,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:16:37,290 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 29 states. [2018-09-26 08:16:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:37,877 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:16:37,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:16:37,877 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2018-09-26 08:16:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:37,878 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:16:37,878 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:16:37,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:16:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:16:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:16:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:16:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:16:37,914 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-09-26 08:16:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:37,914 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:16:37,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:16:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:16:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:16:37,915 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:37,915 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-09-26 08:16:37,917 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:37,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:37,917 INFO L82 PathProgramCache]: Analyzing trace with hash 473878689, now seen corresponding path program 25 times [2018-09-26 08:16:37,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:38,190 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:38,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:16:38,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:16:38,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:16:38,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:16:38,192 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 30 states. [2018-09-26 08:16:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:38,875 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:16:38,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:16:38,875 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2018-09-26 08:16:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:38,876 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:16:38,876 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:16:38,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:16:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:16:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:16:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:16:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:16:38,916 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-09-26 08:16:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:38,917 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:16:38,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:16:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:16:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:16:38,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:38,918 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-09-26 08:16:38,918 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:38,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:38,919 INFO L82 PathProgramCache]: Analyzing trace with hash 130819741, now seen corresponding path program 26 times [2018-09-26 08:16:38,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:39,288 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:39,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:16:39,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:16:39,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:16:39,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:16:39,289 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 31 states. [2018-09-26 08:16:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:39,969 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:16:39,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:16:39,970 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-09-26 08:16:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:39,971 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:16:39,971 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:16:39,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:16:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:16:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:16:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:16:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:16:40,005 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-09-26 08:16:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:40,005 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:16:40,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:16:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:16:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:16:40,006 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:40,009 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-09-26 08:16:40,009 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:40,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:40,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1163652505, now seen corresponding path program 27 times [2018-09-26 08:16:40,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:40,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:40,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:16:40,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:16:40,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:16:40,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:16:40,302 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 32 states. [2018-09-26 08:16:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:41,037 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:16:41,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:16:41,038 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2018-09-26 08:16:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:41,039 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:16:41,039 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:16:41,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:16:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:16:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:16:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:16:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:16:41,075 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-09-26 08:16:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:41,075 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:16:41,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:16:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:16:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:16:41,076 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:41,076 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-09-26 08:16:41,076 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:41,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1578493333, now seen corresponding path program 28 times [2018-09-26 08:16:41,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:41,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:41,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:16:41,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:16:41,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:16:41,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:16:41,371 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 33 states. [2018-09-26 08:16:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:42,092 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:16:42,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:16:42,092 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 60 [2018-09-26 08:16:42,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:42,093 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:16:42,093 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:16:42,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:16:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:16:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:16:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:16:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:16:42,127 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-09-26 08:16:42,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:42,127 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:16:42,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:16:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:16:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:16:42,128 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:42,128 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-09-26 08:16:42,129 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:42,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:42,129 INFO L82 PathProgramCache]: Analyzing trace with hash 808570513, now seen corresponding path program 29 times [2018-09-26 08:16:42,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:42,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:42,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:16:42,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:16:42,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:16:42,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:16:42,453 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 34 states. [2018-09-26 08:16:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:43,216 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:16:43,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:16:43,216 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2018-09-26 08:16:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:43,217 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:16:43,217 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:16:43,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:16:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:16:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:16:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:16:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:16:43,249 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-09-26 08:16:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:43,249 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:16:43,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:16:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:16:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:16:43,250 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:43,250 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-09-26 08:16:43,250 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:43,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:43,251 INFO L82 PathProgramCache]: Analyzing trace with hash -352884595, now seen corresponding path program 30 times [2018-09-26 08:16:43,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:43,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:43,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:16:43,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:16:43,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:16:43,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:16:43,549 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 35 states. [2018-09-26 08:16:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:44,311 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:16:44,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:16:44,311 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 64 [2018-09-26 08:16:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:44,312 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:16:44,312 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:16:44,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:16:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:16:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:16:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:16:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:16:44,341 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-09-26 08:16:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:44,342 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:16:44,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:16:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:16:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:16:44,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:44,343 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-09-26 08:16:44,343 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:44,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:44,343 INFO L82 PathProgramCache]: Analyzing trace with hash 180253577, now seen corresponding path program 31 times [2018-09-26 08:16:44,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:44,683 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:44,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:16:44,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:16:44,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:16:44,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:16:44,686 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2018-09-26 08:16:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:45,575 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:16:45,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:16:45,575 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2018-09-26 08:16:45,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:45,576 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:16:45,576 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:16:45,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:16:45,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:16:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:16:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:16:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:16:45,616 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-09-26 08:16:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:45,617 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:16:45,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:16:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:16:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:16:45,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:45,618 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-09-26 08:16:45,618 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:45,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1424928645, now seen corresponding path program 32 times [2018-09-26 08:16:45,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:46,024 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:46,024 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:16:46,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:16:46,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:16:46,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:16:46,029 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 37 states. [2018-09-26 08:16:46,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:46,814 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:16:46,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:16:46,815 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2018-09-26 08:16:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:46,816 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:16:46,816 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:16:46,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:16:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:16:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:16:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:16:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:16:46,849 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-09-26 08:16:46,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:46,850 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:16:46,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:16:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:16:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:16:46,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:46,851 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-09-26 08:16:46,851 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:46,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:46,851 INFO L82 PathProgramCache]: Analyzing trace with hash -738206591, now seen corresponding path program 33 times [2018-09-26 08:16:46,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:47,166 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:47,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:16:47,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:16:47,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:16:47,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:16:47,167 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 38 states. [2018-09-26 08:16:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:48,024 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:16:48,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:16:48,024 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2018-09-26 08:16:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:48,025 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:16:48,025 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:16:48,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:16:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:16:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:16:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:16:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:16:48,061 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-09-26 08:16:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:48,061 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:16:48,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:16:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:16:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:16:48,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:48,062 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-09-26 08:16:48,063 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:48,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:48,063 INFO L82 PathProgramCache]: Analyzing trace with hash -746997123, now seen corresponding path program 34 times [2018-09-26 08:16:48,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:48,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:48,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:48,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:16:48,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:16:48,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:16:48,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:16:48,418 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 39 states. [2018-09-26 08:16:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:49,288 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:16:49,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:16:49,288 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2018-09-26 08:16:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:49,289 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:16:49,289 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:16:49,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:16:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:16:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:16:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:16:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:16:49,322 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-09-26 08:16:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:49,323 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:16:49,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:16:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:16:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:16:49,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:49,324 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-09-26 08:16:49,324 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:49,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:49,324 INFO L82 PathProgramCache]: Analyzing trace with hash -604763783, now seen corresponding path program 35 times [2018-09-26 08:16:49,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:49,656 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:49,656 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:16:49,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:16:49,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:16:49,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:16:49,658 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 40 states. [2018-09-26 08:16:50,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:50,514 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:16:50,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:16:50,514 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2018-09-26 08:16:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:50,515 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:16:50,515 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:16:50,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:16:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:16:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:16:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:16:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:16:50,545 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-09-26 08:16:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:50,545 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:16:50,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:16:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:16:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:16:50,546 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:50,546 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-09-26 08:16:50,546 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:50,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1357477515, now seen corresponding path program 36 times [2018-09-26 08:16:50,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:50,903 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:50,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:16:50,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:16:50,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:16:50,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:16:50,904 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 41 states. [2018-09-26 08:16:51,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:51,919 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:16:51,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:16:51,919 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2018-09-26 08:16:51,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:51,920 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:16:51,920 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:16:51,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:16:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:16:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:16:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:16:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:16:51,967 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-09-26 08:16:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:51,967 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:16:51,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:16:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:16:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:16:51,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:51,969 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-09-26 08:16:51,969 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:51,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1134099057, now seen corresponding path program 37 times [2018-09-26 08:16:52,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:52,362 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:52,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:16:52,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:16:52,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:16:52,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:16:52,364 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 42 states. [2018-09-26 08:16:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:53,300 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:16:53,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:16:53,300 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2018-09-26 08:16:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:53,301 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:16:53,301 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:16:53,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:16:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:16:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:16:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:16:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:16:53,333 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-09-26 08:16:53,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:53,334 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:16:53,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:16:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:16:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:16:53,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:53,335 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-09-26 08:16:53,335 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:53,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:53,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1052566419, now seen corresponding path program 38 times [2018-09-26 08:16:53,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:53,725 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:53,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:16:53,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:16:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:16:53,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:16:53,727 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 43 states. [2018-09-26 08:16:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:54,746 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:16:54,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:16:54,746 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 80 [2018-09-26 08:16:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:54,747 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:16:54,747 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:16:54,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:16:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:16:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:16:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:16:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:16:54,779 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-09-26 08:16:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:54,779 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:16:54,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:16:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:16:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:16:54,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:54,780 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-09-26 08:16:54,781 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:54,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:54,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2095886185, now seen corresponding path program 39 times [2018-09-26 08:16:54,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:55,189 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:55,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:16:55,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:16:55,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:16:55,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:16:55,190 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 44 states. [2018-09-26 08:16:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:56,119 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:16:56,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:16:56,119 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2018-09-26 08:16:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:56,120 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:16:56,120 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:16:56,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:16:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:16:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:16:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:16:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:16:56,152 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-09-26 08:16:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:56,153 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:16:56,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:16:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:16:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:16:56,154 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:56,154 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-09-26 08:16:56,154 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:56,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:56,155 INFO L82 PathProgramCache]: Analyzing trace with hash -193105051, now seen corresponding path program 40 times [2018-09-26 08:16:56,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:56,519 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:56,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:16:56,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:16:56,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:16:56,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:16:56,520 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 45 states. [2018-09-26 08:16:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:57,294 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:16:57,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:16:57,295 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2018-09-26 08:16:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:57,295 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:16:57,296 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:16:57,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:16:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:16:57,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:16:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:16:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:16:57,329 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-09-26 08:16:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:57,329 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:16:57,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:16:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:16:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:16:57,330 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:57,330 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-09-26 08:16:57,331 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:57,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:57,331 INFO L82 PathProgramCache]: Analyzing trace with hash -890427295, now seen corresponding path program 41 times [2018-09-26 08:16:57,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:57,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:57,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:16:57,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:16:57,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:16:57,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:16:57,721 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 46 states. [2018-09-26 08:16:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:58,581 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:16:58,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:16:58,582 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2018-09-26 08:16:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:58,582 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:16:58,583 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:16:58,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:16:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:16:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:16:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:16:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:16:58,610 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-09-26 08:16:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:58,610 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:16:58,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:16:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:16:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:16:58,611 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:58,611 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-09-26 08:16:58,611 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:58,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1002205603, now seen corresponding path program 42 times [2018-09-26 08:16:58,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:58,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:58,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:16:58,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:16:58,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:16:58,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:16:58,962 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 47 states. [2018-09-26 08:16:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:59,809 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:16:59,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:16:59,809 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 88 [2018-09-26 08:16:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:59,810 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:16:59,810 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:16:59,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=7571, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:16:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:16:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:16:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:16:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:16:59,850 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-09-26 08:16:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:59,851 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:16:59,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:16:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:16:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:16:59,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:59,852 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-09-26 08:16:59,852 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:59,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:59,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1046977191, now seen corresponding path program 43 times [2018-09-26 08:16:59,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:00,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:00,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:17:00,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:17:00,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:17:00,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:17:00,284 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 48 states. [2018-09-26 08:17:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:01,152 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:17:01,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:17:01,152 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2018-09-26 08:17:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:01,153 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:17:01,153 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:17:01,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:17:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:17:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:17:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:17:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:17:01,194 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-09-26 08:17:01,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:01,195 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:17:01,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:17:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:17:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:17:01,196 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:01,196 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-09-26 08:17:01,196 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:01,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:01,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1122800299, now seen corresponding path program 44 times [2018-09-26 08:17:01,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:01,668 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:01,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:17:01,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:17:01,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:17:01,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:17:01,669 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 49 states. [2018-09-26 08:17:02,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:02,743 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:17:02,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:17:02,743 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 92 [2018-09-26 08:17:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:02,744 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:17:02,744 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:17:02,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=8283, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:17:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:17:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:17:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:17:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:17:02,780 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-09-26 08:17:02,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:02,780 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:17:02,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:17:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:17:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:17:02,781 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:02,781 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-09-26 08:17:02,781 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:02,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:02,782 INFO L82 PathProgramCache]: Analyzing trace with hash -974363055, now seen corresponding path program 45 times [2018-09-26 08:17:02,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:03,270 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:03,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:17:03,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:17:03,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:17:03,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:17:03,272 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 50 states. [2018-09-26 08:17:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:04,445 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:17:04,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:17:04,445 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2018-09-26 08:17:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:04,446 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:17:04,446 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:17:04,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:17:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:17:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:17:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:17:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:17:04,477 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-09-26 08:17:04,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:04,477 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:17:04,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:17:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:17:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:17:04,478 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:04,478 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-09-26 08:17:04,478 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:04,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:04,479 INFO L82 PathProgramCache]: Analyzing trace with hash -60092339, now seen corresponding path program 46 times [2018-09-26 08:17:04,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:04,844 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:04,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:17:04,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:17:04,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:17:04,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:17:04,845 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 51 states. [2018-09-26 08:17:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:05,884 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:17:05,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:17:05,885 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2018-09-26 08:17:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:05,886 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:17:05,886 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:17:05,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=9027, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:17:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:17:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:17:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:17:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:17:05,932 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-09-26 08:17:05,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:05,932 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:17:05,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:17:05,932 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:17:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:17:05,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:05,933 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-09-26 08:17:05,933 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:05,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:05,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1914229943, now seen corresponding path program 47 times [2018-09-26 08:17:05,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:06,365 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:06,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:17:06,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:17:06,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:17:06,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:17:06,366 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 52 states. [2018-09-26 08:17:07,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:07,373 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:17:07,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:17:07,373 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2018-09-26 08:17:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:07,374 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:17:07,374 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:17:07,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:17:07,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:17:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:17:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:17:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:17:07,407 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-09-26 08:17:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:07,407 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:17:07,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:17:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:17:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:17:07,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:07,408 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-09-26 08:17:07,408 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:07,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:07,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1329039547, now seen corresponding path program 48 times [2018-09-26 08:17:07,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:07,802 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:07,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:17:07,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:17:07,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:17:07,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:17:07,803 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2018-09-26 08:17:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:09,091 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:17:09,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:17:09,092 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2018-09-26 08:17:09,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:09,093 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:17:09,093 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:17:09,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=9803, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:17:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:17:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:17:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:17:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:17:09,142 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-09-26 08:17:09,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:09,143 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:17:09,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:17:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:17:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:17:09,143 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:09,144 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-09-26 08:17:09,144 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:09,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:09,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1601784767, now seen corresponding path program 49 times [2018-09-26 08:17:09,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:09,657 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:09,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:17:09,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:17:09,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:17:09,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:17:09,658 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 54 states. [2018-09-26 08:17:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:10,746 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:17:10,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:17:10,746 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2018-09-26 08:17:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:10,747 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:17:10,747 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:17:10,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:17:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:17:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:17:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:17:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:17:10,790 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-09-26 08:17:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:10,790 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:17:10,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:17:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:17:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:17:10,790 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:10,791 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-09-26 08:17:10,791 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:10,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1716936131, now seen corresponding path program 50 times [2018-09-26 08:17:10,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:11,227 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:11,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:17:11,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:17:11,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:17:11,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:17:11,228 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 55 states. [2018-09-26 08:17:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:12,298 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:17:12,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:17:12,298 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 104 [2018-09-26 08:17:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:12,299 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:17:12,299 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:17:12,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=10611, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:17:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:17:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:17:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:17:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:17:12,343 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-09-26 08:17:12,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:12,344 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:17:12,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:17:12,344 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:17:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:17:12,345 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:12,345 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-09-26 08:17:12,345 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:12,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:12,345 INFO L82 PathProgramCache]: Analyzing trace with hash -708247239, now seen corresponding path program 51 times [2018-09-26 08:17:12,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:12,794 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:12,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:17:12,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:17:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:17:12,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:17:12,795 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 56 states. [2018-09-26 08:17:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:13,969 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:17:13,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:17:13,969 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2018-09-26 08:17:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:13,970 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:17:13,970 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:17:13,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:17:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:17:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:17:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:17:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:17:14,006 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-09-26 08:17:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:14,007 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:17:14,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:17:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:17:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:17:14,007 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:14,008 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-09-26 08:17:14,008 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:14,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:14,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2020830923, now seen corresponding path program 52 times [2018-09-26 08:17:14,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:14,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:14,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:17:14,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:17:14,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:17:14,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=3080, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:17:14,452 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 57 states. [2018-09-26 08:17:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:15,776 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:17:15,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:17:15,776 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 108 [2018-09-26 08:17:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:15,777 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:17:15,777 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:17:15,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=11451, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:17:15,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:17:15,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:17:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:17:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:17:15,827 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-09-26 08:17:15,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:15,827 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:17:15,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:17:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:17:15,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:17:15,828 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:15,828 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-09-26 08:17:15,829 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:15,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:15,829 INFO L82 PathProgramCache]: Analyzing trace with hash -693366223, now seen corresponding path program 53 times [2018-09-26 08:17:15,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:16,306 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:16,306 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:17:16,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:17:16,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:17:16,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:17:16,307 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 58 states. [2018-09-26 08:17:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:17,586 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:17:17,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:17:17,586 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 110 [2018-09-26 08:17:17,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:17,587 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:17:17,587 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:17:17,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:17:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:17:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:17:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:17:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:17:17,627 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-09-26 08:17:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:17,627 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:17:17,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:17:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:17:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:17:17,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:17,628 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-09-26 08:17:17,628 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:17,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:17,629 INFO L82 PathProgramCache]: Analyzing trace with hash -605076435, now seen corresponding path program 54 times [2018-09-26 08:17:17,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:18,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:18,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:17:18,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:17:18,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:17:18,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:17:18,218 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 59 states. [2018-09-26 08:17:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:19,532 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:17:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:17:19,532 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 112 [2018-09-26 08:17:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:19,533 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:17:19,533 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:17:19,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=333, Invalid=12323, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:17:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:17:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:17:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:17:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:17:19,574 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-09-26 08:17:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:19,574 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:17:19,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:17:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:17:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:17:19,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:19,575 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-09-26 08:17:19,575 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:19,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:19,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1657936087, now seen corresponding path program 55 times [2018-09-26 08:17:19,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:20,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:20,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:17:20,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:17:20,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:17:20,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=3422, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:17:20,088 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 60 states. [2018-09-26 08:17:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:21,439 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 08:17:21,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:17:21,439 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 114 [2018-09-26 08:17:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:21,440 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:17:21,440 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:17:21,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:17:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:17:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:17:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:17:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:17:21,488 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-09-26 08:17:21,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:21,489 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:17:21,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:17:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:17:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:17:21,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:21,489 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-09-26 08:17:21,489 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:21,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash 156220197, now seen corresponding path program 56 times [2018-09-26 08:17:21,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:22,119 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:22,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:17:22,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:17:22,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:17:22,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=3540, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:17:22,120 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 61 states. [2018-09-26 08:17:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:23,658 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-26 08:17:23,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:17:23,658 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 116 [2018-09-26 08:17:23,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:23,659 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:17:23,659 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:17:23,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=345, Invalid=13227, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:17:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:17:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:17:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:17:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:17:23,702 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-09-26 08:17:23,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:23,702 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:17:23,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:17:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:17:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:17:23,703 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:23,703 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-09-26 08:17:23,704 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:23,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:23,704 INFO L82 PathProgramCache]: Analyzing trace with hash -196313055, now seen corresponding path program 57 times [2018-09-26 08:17:23,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:24,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:24,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:17:24,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:17:24,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:17:24,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=3660, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:17:24,237 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 62 states. [2018-09-26 08:17:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:25,676 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 08:17:25,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:17:25,676 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 118 [2018-09-26 08:17:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:25,677 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:17:25,677 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:17:25,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:17:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:17:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:17:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:17:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:17:25,722 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-09-26 08:17:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:25,723 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:17:25,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:17:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:17:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:17:25,723 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:25,723 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-09-26 08:17:25,724 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:25,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:25,724 INFO L82 PathProgramCache]: Analyzing trace with hash 321648157, now seen corresponding path program 58 times [2018-09-26 08:17:25,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:26,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:26,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:17:26,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:17:26,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:17:26,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=3782, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:17:26,284 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 63 states. [2018-09-26 08:17:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:27,740 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:17:27,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:17:27,740 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 120 [2018-09-26 08:17:27,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:27,741 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:17:27,741 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:17:27,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=357, Invalid=14163, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:17:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:17:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:17:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:17:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:17:27,796 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-09-26 08:17:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:27,796 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:17:27,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:17:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:17:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:17:27,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:27,797 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-09-26 08:17:27,797 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:27,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash -133833447, now seen corresponding path program 59 times [2018-09-26 08:17:27,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:28,430 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:28,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:17:28,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:17:28,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:17:28,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=3906, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:17:28,432 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 64 states. [2018-09-26 08:17:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:29,956 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 08:17:29,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:17:29,956 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 122 [2018-09-26 08:17:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:29,957 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:17:29,957 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:17:29,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:17:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:17:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:17:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:17:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:17:30,010 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-09-26 08:17:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:30,010 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:17:30,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:17:30,010 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:17:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:17:30,011 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:30,011 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-09-26 08:17:30,011 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:30,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:30,012 INFO L82 PathProgramCache]: Analyzing trace with hash 235009301, now seen corresponding path program 60 times [2018-09-26 08:17:30,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:30,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:30,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:17:30,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:17:30,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:17:30,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=4032, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:17:30,606 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 65 states. [2018-09-26 08:17:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:32,180 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-09-26 08:17:32,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:17:32,181 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 124 [2018-09-26 08:17:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:32,181 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:17:32,181 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:17:32,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=15131, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:17:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:17:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:17:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:17:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:17:32,229 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-09-26 08:17:32,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:32,230 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:17:32,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:17:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:17:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:17:32,231 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:32,231 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-09-26 08:17:32,231 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:32,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:32,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1789395439, now seen corresponding path program 61 times [2018-09-26 08:17:32,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:32,863 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:32,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:17:32,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:17:32,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:17:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=4160, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:17:32,865 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 66 states. [2018-09-26 08:17:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:34,480 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 08:17:34,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:17:34,480 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 126 [2018-09-26 08:17:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:34,481 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:17:34,481 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:17:34,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:17:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:17:34,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:17:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:17:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:17:34,538 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-09-26 08:17:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:34,538 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:17:34,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:17:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:17:34,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:17:34,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:34,539 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-09-26 08:17:34,539 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:34,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:34,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1622165491, now seen corresponding path program 62 times [2018-09-26 08:17:34,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:35,187 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:35,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:17:35,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:17:35,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:17:35,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=4290, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:17:35,189 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 67 states. [2018-09-26 08:17:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:36,786 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-09-26 08:17:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:17:36,786 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 128 [2018-09-26 08:17:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:36,787 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:17:36,787 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:17:36,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=381, Invalid=16131, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:17:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:17:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:17:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:17:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:17:36,833 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-09-26 08:17:36,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:36,834 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:17:36,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:17:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:17:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:17:36,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:36,835 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-09-26 08:17:36,835 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:36,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:36,835 INFO L82 PathProgramCache]: Analyzing trace with hash 172024585, now seen corresponding path program 63 times [2018-09-26 08:17:36,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:37,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:37,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:17:37,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:17:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:17:37,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=4422, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:17:37,641 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 68 states. [2018-09-26 08:17:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:39,302 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:17:39,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:17:39,302 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 130 [2018-09-26 08:17:39,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:39,303 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:17:39,303 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:17:39,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:17:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:17:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:17:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:17:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:17:39,358 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-09-26 08:17:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:39,359 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:17:39,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:17:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:17:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:17:39,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:39,360 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-09-26 08:17:39,360 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:39,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:39,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2106801925, now seen corresponding path program 64 times [2018-09-26 08:17:39,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:39,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:39,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:17:39,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:17:39,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:17:39,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=4556, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:17:39,977 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 69 states. [2018-09-26 08:17:41,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:41,590 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-09-26 08:17:41,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:17:41,590 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 132 [2018-09-26 08:17:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:41,591 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:17:41,591 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:17:41,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=393, Invalid=17163, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:17:41,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:17:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:17:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:17:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:17:41,647 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-09-26 08:17:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:41,647 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:17:41,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:17:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:17:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:17:41,648 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:41,648 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-09-26 08:17:41,649 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:41,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:41,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1706986497, now seen corresponding path program 65 times [2018-09-26 08:17:41,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:42,372 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:42,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:17:42,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:17:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:17:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=4692, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:17:42,373 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 70 states. [2018-09-26 08:17:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:44,404 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 08:17:44,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:17:44,404 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 134 [2018-09-26 08:17:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:44,405 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:17:44,405 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:17:44,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:17:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:17:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:17:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:17:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:17:44,485 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-09-26 08:17:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:44,486 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:17:44,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:17:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:17:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:17:44,487 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:44,487 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-09-26 08:17:44,487 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:44,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash -263550467, now seen corresponding path program 66 times [2018-09-26 08:17:44,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:45,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:45,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:17:45,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:17:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:17:45,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=4830, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:17:45,579 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 71 states. [2018-09-26 08:17:47,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:47,740 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 08:17:47,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:17:47,740 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 136 [2018-09-26 08:17:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:47,741 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:17:47,741 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:17:47,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=405, Invalid=18227, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:17:47,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:17:47,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:17:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:17:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:17:47,800 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-09-26 08:17:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:47,800 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:17:47,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:17:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:17:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:17:47,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:47,801 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-09-26 08:17:47,802 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:47,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:47,802 INFO L82 PathProgramCache]: Analyzing trace with hash 131004665, now seen corresponding path program 67 times [2018-09-26 08:17:47,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:48,682 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:48,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:17:48,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:17:48,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:17:48,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=4970, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:17:48,683 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 72 states. [2018-09-26 08:17:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:50,775 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 08:17:50,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:17:50,776 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 138 [2018-09-26 08:17:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:50,776 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:17:50,776 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:17:50,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:17:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:17:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:17:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:17:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:17:50,845 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-09-26 08:17:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:50,845 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:17:50,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:17:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:17:50,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:17:50,846 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:50,846 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-09-26 08:17:50,846 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:50,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:50,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1341364469, now seen corresponding path program 68 times [2018-09-26 08:17:50,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:51,633 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:51,633 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:17:51,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:17:51,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:17:51,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=5112, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:17:51,634 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 73 states. [2018-09-26 08:17:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:53,655 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 08:17:53,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:17:53,656 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 140 [2018-09-26 08:17:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:53,656 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:17:53,656 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:17:53,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=417, Invalid=19323, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:17:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:17:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:17:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:17:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:17:53,721 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-09-26 08:17:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:53,721 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:17:53,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:17:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:17:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:17:53,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:53,722 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-09-26 08:17:53,722 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:53,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:53,723 INFO L82 PathProgramCache]: Analyzing trace with hash 560998897, now seen corresponding path program 69 times [2018-09-26 08:17:53,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:54,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:54,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:17:54,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:17:54,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:17:54,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=5256, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:17:54,565 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 74 states. [2018-09-26 08:17:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:56,525 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 08:17:56,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:17:56,525 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 142 [2018-09-26 08:17:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:56,526 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:17:56,526 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:17:56,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:17:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:17:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:17:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:17:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:17:56,612 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-09-26 08:17:56,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:56,613 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:17:56,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:17:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:17:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:17:56,614 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:56,614 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-09-26 08:17:56,614 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:56,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:56,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2046006291, now seen corresponding path program 70 times [2018-09-26 08:17:56,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:57,620 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:57,621 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:17:57,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:17:57,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:17:57,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=5402, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:17:57,622 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 75 states. [2018-09-26 08:17:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:59,931 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-09-26 08:17:59,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:17:59,931 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 144 [2018-09-26 08:17:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:59,932 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:17:59,932 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:17:59,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=429, Invalid=20451, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:17:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:18:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:18:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:18:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:18:00,014 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-09-26 08:18:00,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:00,015 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:18:00,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:18:00,015 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:18:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:18:00,016 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:00,016 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-09-26 08:18:00,016 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:00,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:00,016 INFO L82 PathProgramCache]: Analyzing trace with hash 882908905, now seen corresponding path program 71 times [2018-09-26 08:18:00,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:00,866 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:00,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:18:00,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:18:00,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:18:00,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=5550, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:18:00,867 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 76 states. [2018-09-26 08:18:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:03,037 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 08:18:03,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:18:03,037 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 146 [2018-09-26 08:18:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:03,038 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:18:03,038 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:18:03,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:18:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:18:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:18:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:18:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:18:03,112 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-09-26 08:18:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:03,112 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:18:03,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:18:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:18:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:18:03,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:03,113 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-09-26 08:18:03,114 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:03,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:03,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1928133915, now seen corresponding path program 72 times [2018-09-26 08:18:03,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:03,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:03,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:18:03,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:18:03,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:18:03,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=5700, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:18:03,962 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 77 states. [2018-09-26 08:18:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:06,163 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-09-26 08:18:06,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:18:06,163 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 148 [2018-09-26 08:18:06,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:06,164 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:18:06,164 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:18:06,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=441, Invalid=21611, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:18:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:18:06,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:18:06,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:18:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:18:06,237 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-09-26 08:18:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:06,237 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:18:06,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:18:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:18:06,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:18:06,238 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:06,238 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-09-26 08:18:06,238 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:06,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:06,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1805854751, now seen corresponding path program 73 times [2018-09-26 08:18:06,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:07,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:07,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:18:07,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:18:07,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:18:07,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=5852, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:18:07,132 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 78 states. [2018-09-26 08:18:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:09,383 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 08:18:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:18:09,384 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 150 [2018-09-26 08:18:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:09,384 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:18:09,384 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:18:09,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:18:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:18:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:18:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:18:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:18:09,454 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-09-26 08:18:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:09,455 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:18:09,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:18:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:18:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:18:09,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:09,455 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-09-26 08:18:09,456 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:09,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash -259695139, now seen corresponding path program 74 times [2018-09-26 08:18:09,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:10,379 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:10,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:18:10,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:18:10,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:18:10,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=6006, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:18:10,380 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 79 states. [2018-09-26 08:18:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:12,693 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-09-26 08:18:12,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:18:12,694 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 152 [2018-09-26 08:18:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:12,695 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:18:12,695 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:18:12,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=453, Invalid=22803, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:18:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:18:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:18:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:18:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:18:12,772 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-09-26 08:18:12,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:12,772 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:18:12,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:18:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:18:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:18:12,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:12,773 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-09-26 08:18:12,773 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:12,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:12,773 INFO L82 PathProgramCache]: Analyzing trace with hash -458992423, now seen corresponding path program 75 times [2018-09-26 08:18:12,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:13,774 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:13,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:18:13,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:18:13,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:18:13,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=6162, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:18:13,775 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 80 states. [2018-09-26 08:18:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:16,117 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 08:18:16,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:18:16,117 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 154 [2018-09-26 08:18:16,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:16,118 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:18:16,118 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:18:16,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:18:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:18:16,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:18:16,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:18:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 08:18:16,189 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-09-26 08:18:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:16,189 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 08:18:16,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:18:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 08:18:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:18:16,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:16,190 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-09-26 08:18:16,190 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:16,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:16,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1289845973, now seen corresponding path program 76 times [2018-09-26 08:18:16,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:17,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:17,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:18:17,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:18:17,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:18:17,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=6320, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:18:17,216 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 81 states. [2018-09-26 08:18:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:19,632 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-26 08:18:19,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:18:19,632 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 156 [2018-09-26 08:18:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:19,633 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:18:19,633 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:18:19,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=24027, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:18:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:18:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:18:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:18:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-09-26 08:18:19,706 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-09-26 08:18:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:19,707 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-09-26 08:18:19,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:18:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-09-26 08:18:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:18:19,707 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:19,708 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-09-26 08:18:19,708 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:19,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:19,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1703635503, now seen corresponding path program 77 times [2018-09-26 08:18:19,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:20,706 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:20,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:18:20,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:18:20,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:18:20,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=6480, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:18:20,707 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 82 states. [2018-09-26 08:18:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:23,186 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-26 08:18:23,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:18:23,186 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 158 [2018-09-26 08:18:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:23,187 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:18:23,187 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:18:23,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:18:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:18:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:18:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:18:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:18:23,261 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-09-26 08:18:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:23,261 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:18:23,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:18:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:18:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:18:23,262 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:23,262 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-09-26 08:18:23,262 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:23,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:23,263 INFO L82 PathProgramCache]: Analyzing trace with hash -811245619, now seen corresponding path program 78 times [2018-09-26 08:18:23,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:24,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:24,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:18:24,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:18:24,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:18:24,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=6642, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:18:24,298 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 83 states. [2018-09-26 08:18:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:26,829 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-26 08:18:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:18:26,829 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 160 [2018-09-26 08:18:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:26,830 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:18:26,830 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:18:26,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=477, Invalid=25283, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:18:26,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:18:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:18:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:18:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-09-26 08:18:26,906 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-09-26 08:18:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:26,906 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-09-26 08:18:26,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:18:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-09-26 08:18:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:18:26,907 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:26,907 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-09-26 08:18:26,907 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:26,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:26,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2076941001, now seen corresponding path program 79 times [2018-09-26 08:18:26,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:27,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:27,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:27,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:18:27,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:18:27,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:18:27,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=6806, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:18:27,965 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 84 states. [2018-09-26 08:18:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:30,599 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-26 08:18:30,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:18:30,600 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 162 [2018-09-26 08:18:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:30,600 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:18:30,601 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:18:30,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:18:30,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:18:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:18:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:18:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 08:18:30,682 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-09-26 08:18:30,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:30,682 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 08:18:30,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:18:30,682 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 08:18:30,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:18:30,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:30,683 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-09-26 08:18:30,683 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:30,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:30,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1219557691, now seen corresponding path program 80 times [2018-09-26 08:18:30,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:31,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:31,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:18:31,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:18:31,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:18:31,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=6972, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:18:31,785 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 85 states. [2018-09-26 08:18:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:34,483 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-09-26 08:18:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:18:34,483 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 164 [2018-09-26 08:18:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:34,484 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:18:34,484 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:18:34,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=489, Invalid=26571, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:18:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:18:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:18:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:18:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:18:34,565 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-09-26 08:18:34,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:34,565 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:18:34,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:18:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:18:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:18:34,566 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:34,566 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-09-26 08:18:34,566 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:34,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:34,567 INFO L82 PathProgramCache]: Analyzing trace with hash 531063745, now seen corresponding path program 81 times [2018-09-26 08:18:34,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:35,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:35,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:18:35,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:18:35,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:18:35,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=7140, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:18:35,721 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 86 states. [2018-09-26 08:18:38,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:38,504 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 08:18:38,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:18:38,504 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 166 [2018-09-26 08:18:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:38,505 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:18:38,505 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:18:38,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=495, Invalid=27227, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:18:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:18:38,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:18:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:18:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 08:18:38,604 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-09-26 08:18:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:38,604 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 08:18:38,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:18:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 08:18:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:18:38,605 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:38,605 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-09-26 08:18:38,606 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:38,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:38,606 INFO L82 PathProgramCache]: Analyzing trace with hash -748916291, now seen corresponding path program 82 times [2018-09-26 08:18:38,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:39,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:39,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:18:39,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:18:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:18:39,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=7310, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:18:39,756 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 87 states. [2018-09-26 08:18:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:42,588 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-09-26 08:18:42,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:18:42,588 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 168 [2018-09-26 08:18:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:42,589 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:18:42,589 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:18:42,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=501, Invalid=27891, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:18:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:18:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:18:42,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:18:42,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 08:18:42,706 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-09-26 08:18:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:42,706 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 08:18:42,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:18:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 08:18:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:18:42,707 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:42,707 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-09-26 08:18:42,708 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:42,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:42,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1845883065, now seen corresponding path program 83 times [2018-09-26 08:18:42,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:43,931 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:43,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:18:43,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:18:43,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:18:43,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=7482, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:18:43,932 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 88 states. [2018-09-26 08:18:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:46,828 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 08:18:46,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:18:46,828 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 170 [2018-09-26 08:18:46,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:46,829 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:18:46,829 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:18:46,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=507, Invalid=28563, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:18:46,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:18:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:18:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:18:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:18:46,926 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-09-26 08:18:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:46,927 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:18:46,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:18:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:18:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:18:46,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:46,927 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-09-26 08:18:46,928 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:46,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:46,928 INFO L82 PathProgramCache]: Analyzing trace with hash 72065205, now seen corresponding path program 84 times [2018-09-26 08:18:46,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:48,157 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:48,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:18:48,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:18:48,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:18:48,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=7656, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:18:48,158 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 89 states. [2018-09-26 08:18:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:51,110 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-09-26 08:18:51,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:18:51,111 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 172 [2018-09-26 08:18:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:51,112 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:18:51,112 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:18:51,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=513, Invalid=29243, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:18:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:18:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:18:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:18:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-09-26 08:18:51,202 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-09-26 08:18:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:51,202 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-09-26 08:18:51,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:18:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-09-26 08:18:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:18:51,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:51,203 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-09-26 08:18:51,203 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:51,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:51,204 INFO L82 PathProgramCache]: Analyzing trace with hash 535118257, now seen corresponding path program 85 times [2018-09-26 08:18:51,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:52,527 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:52,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:18:52,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:18:52,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:18:52,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=7832, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:18:52,528 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 90 states. [2018-09-26 08:18:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:55,483 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-26 08:18:55,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:18:55,483 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 174 [2018-09-26 08:18:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:55,484 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:18:55,484 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:18:55,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=519, Invalid=29931, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:18:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:18:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:18:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:18:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 08:18:55,576 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-09-26 08:18:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:55,576 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 08:18:55,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:18:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 08:18:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:18:55,577 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:55,578 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-09-26 08:18:55,578 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:55,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1147497555, now seen corresponding path program 86 times [2018-09-26 08:18:55,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:56,900 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:56,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:18:56,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:18:56,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:18:56,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=8010, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:18:56,901 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 91 states. [2018-09-26 08:18:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:59,990 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-09-26 08:18:59,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:18:59,990 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 176 [2018-09-26 08:18:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:59,991 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:18:59,991 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:18:59,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=525, Invalid=30627, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:18:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:19:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:19:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:19:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-09-26 08:19:00,086 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-09-26 08:19:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:00,086 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-09-26 08:19:00,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:19:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-09-26 08:19:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:19:00,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:00,087 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-09-26 08:19:00,087 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:00,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1061377705, now seen corresponding path program 87 times [2018-09-26 08:19:00,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:01,391 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:01,391 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:19:01,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:19:01,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:19:01,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=8190, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:19:01,392 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 92 states. [2018-09-26 08:19:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:04,558 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-26 08:19:04,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:19:04,559 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 178 [2018-09-26 08:19:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:04,559 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:19:04,560 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:19:04,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:19:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:19:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:19:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:19:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 08:19:04,669 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-09-26 08:19:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:04,670 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 08:19:04,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:19:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 08:19:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:19:04,671 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:04,671 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-09-26 08:19:04,671 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:04,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:04,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2076658341, now seen corresponding path program 88 times [2018-09-26 08:19:04,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:06,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:06,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:06,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:19:06,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:19:06,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:19:06,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=8372, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:19:06,046 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 93 states. [2018-09-26 08:19:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:09,290 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-26 08:19:09,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:19:09,290 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 180 [2018-09-26 08:19:09,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:09,291 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:19:09,291 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:19:09,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=537, Invalid=32043, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:19:09,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:19:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:19:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:19:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-09-26 08:19:09,390 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-09-26 08:19:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:09,390 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-09-26 08:19:09,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:19:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-09-26 08:19:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:19:09,391 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:09,391 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-09-26 08:19:09,392 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:09,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:09,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1491193951, now seen corresponding path program 89 times [2018-09-26 08:19:09,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:10,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:10,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:19:10,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:19:10,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:19:10,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=8556, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:19:10,806 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 94 states. [2018-09-26 08:19:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:13,863 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-26 08:19:13,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:19:13,863 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 182 [2018-09-26 08:19:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:13,864 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:19:13,864 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:19:13,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=543, Invalid=32763, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:19:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:19:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-09-26 08:19:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:19:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 08:19:13,954 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-09-26 08:19:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:13,954 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 08:19:13,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:19:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 08:19:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:19:13,955 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:13,955 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-09-26 08:19:13,955 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:13,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:13,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1481622941, now seen corresponding path program 90 times [2018-09-26 08:19:13,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:15,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:15,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:19:15,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:19:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:19:15,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=8742, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:19:15,295 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 95 states. [2018-09-26 08:19:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:18,360 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-09-26 08:19:18,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:19:18,360 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 184 [2018-09-26 08:19:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:18,361 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:19:18,361 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:19:18,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=549, Invalid=33491, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:19:18,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:19:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:19:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:19:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-09-26 08:19:18,454 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-09-26 08:19:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:18,455 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-09-26 08:19:18,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:19:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-09-26 08:19:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:19:18,456 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:18,456 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-09-26 08:19:18,456 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:18,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:18,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2089562983, now seen corresponding path program 91 times [2018-09-26 08:19:18,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:19,830 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:19,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:19:19,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:19:19,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:19:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=8930, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:19:19,832 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 96 states. [2018-09-26 08:19:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:23,209 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-26 08:19:23,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:19:23,210 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 186 [2018-09-26 08:19:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:23,211 INFO L225 Difference]: With dead ends: 191 [2018-09-26 08:19:23,211 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:19:23,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=555, Invalid=34227, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:19:23,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:19:23,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-09-26 08:19:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:19:23,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-26 08:19:23,317 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-09-26 08:19:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:23,317 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-26 08:19:23,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:19:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-26 08:19:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:19:23,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:23,318 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-09-26 08:19:23,318 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:23,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:23,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1974600853, now seen corresponding path program 92 times [2018-09-26 08:19:23,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:24,843 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:24,843 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:19:24,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:19:24,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:19:24,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=9120, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:19:24,844 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 97 states. [2018-09-26 08:19:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:28,358 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-09-26 08:19:28,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:19:28,358 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 188 [2018-09-26 08:19:28,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:28,359 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:19:28,359 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:19:28,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=561, Invalid=34971, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:19:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:19:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-26 08:19:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:19:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 08:19:28,484 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-09-26 08:19:28,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:28,484 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 08:19:28,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:19:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 08:19:28,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:19:28,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:28,486 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-09-26 08:19:28,486 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:28,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:28,486 INFO L82 PathProgramCache]: Analyzing trace with hash -784192111, now seen corresponding path program 93 times [2018-09-26 08:19:28,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:30,092 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:30,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:19:30,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:19:30,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:19:30,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=9312, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:19:30,093 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 98 states. [2018-09-26 08:19:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:33,638 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-26 08:19:33,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:19:33,638 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 190 [2018-09-26 08:19:33,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:33,639 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:19:33,639 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:19:33,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=567, Invalid=35723, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:19:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:19:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 08:19:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:19:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-26 08:19:33,805 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-09-26 08:19:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:33,806 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-26 08:19:33,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:19:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-26 08:19:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:19:33,807 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:33,807 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-09-26 08:19:33,807 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:33,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:33,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1989408883, now seen corresponding path program 94 times [2018-09-26 08:19:33,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:35,516 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:35,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:19:35,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:19:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:19:35,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=9506, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:19:35,517 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 99 states. [2018-09-26 08:19:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:39,262 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-09-26 08:19:39,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:19:39,262 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 192 [2018-09-26 08:19:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:39,263 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:19:39,263 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:19:39,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4465 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=573, Invalid=36483, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:19:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:19:39,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-26 08:19:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:19:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-09-26 08:19:39,381 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-09-26 08:19:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:39,381 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-09-26 08:19:39,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:19:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-09-26 08:19:39,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:19:39,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:39,382 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-09-26 08:19:39,383 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:39,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash -561556855, now seen corresponding path program 95 times [2018-09-26 08:19:39,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:41,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:41,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:19:41,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:19:41,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:19:41,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=9702, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:19:41,087 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 100 states. [2018-09-26 08:19:44,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:44,797 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-26 08:19:44,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:19:44,797 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 194 [2018-09-26 08:19:44,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:44,798 INFO L225 Difference]: With dead ends: 199 [2018-09-26 08:19:44,798 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:19:44,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=579, Invalid=37251, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:19:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:19:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-26 08:19:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:19:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 08:19:44,915 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-09-26 08:19:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:44,915 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 08:19:44,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:19:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 08:19:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:19:44,916 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:44,917 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-09-26 08:19:44,917 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:44,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:44,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1509674629, now seen corresponding path program 96 times [2018-09-26 08:19:44,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:46,544 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:46,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:19:46,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:19:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:19:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=9900, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:19:46,546 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 101 states. [2018-09-26 08:19:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:50,371 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-09-26 08:19:50,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:19:50,372 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 196 [2018-09-26 08:19:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:50,372 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:19:50,372 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:19:50,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4656 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=585, Invalid=38027, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:19:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:19:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-26 08:19:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:19:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-09-26 08:19:50,491 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-09-26 08:19:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:50,492 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-09-26 08:19:50,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:19:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-09-26 08:19:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:19:50,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:50,492 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-09-26 08:19:50,493 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:50,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:50,493 INFO L82 PathProgramCache]: Analyzing trace with hash -901694591, now seen corresponding path program 97 times [2018-09-26 08:19:50,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:52,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:52,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:19:52,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:19:52,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:19:52,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=10100, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:19:52,229 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 102 states. [2018-09-26 08:19:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:56,097 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-26 08:19:56,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:19:56,098 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 198 [2018-09-26 08:19:56,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:56,099 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:19:56,099 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:19:56,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4753 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=591, Invalid=38811, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:19:56,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:19:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-09-26 08:19:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:19:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 08:19:56,220 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-09-26 08:19:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:56,221 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 08:19:56,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:19:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 08:19:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:19:56,221 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:56,222 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-09-26 08:19:56,222 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:56,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:56,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1054824829, now seen corresponding path program 98 times [2018-09-26 08:19:56,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:57,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:57,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:19:57,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:19:57,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:19:57,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=10302, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:19:57,970 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 103 states. [2018-09-26 08:20:01,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:01,673 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-26 08:20:01,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:20:01,673 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 200 [2018-09-26 08:20:01,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:01,674 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:20:01,674 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:20:01,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=597, Invalid=39603, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:20:01,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:20:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:20:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:20:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-09-26 08:20:01,798 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-09-26 08:20:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:01,798 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-09-26 08:20:01,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:20:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-09-26 08:20:01,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:20:01,799 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:01,800 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-09-26 08:20:01,800 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:01,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:01,800 INFO L82 PathProgramCache]: Analyzing trace with hash 74311801, now seen corresponding path program 99 times [2018-09-26 08:20:01,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:03,486 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:03,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:20:03,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:20:03,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:20:03,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=10506, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:20:03,487 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 104 states. [2018-09-26 08:20:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:07,554 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-26 08:20:07,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-09-26 08:20:07,554 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 202 [2018-09-26 08:20:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:07,555 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:20:07,555 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:20:07,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=603, Invalid=40403, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:20:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:20:07,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:20:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:20:07,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-26 08:20:07,679 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-09-26 08:20:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:07,680 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-26 08:20:07,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:20:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-26 08:20:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:20:07,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:07,681 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-09-26 08:20:07,681 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:07,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:07,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1600870283, now seen corresponding path program 100 times [2018-09-26 08:20:07,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:09,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:09,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:20:09,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:20:09,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:20:09,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:20:09,533 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 105 states. [2018-09-26 08:20:13,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:13,760 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-09-26 08:20:13,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:20:13,760 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 204 [2018-09-26 08:20:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:13,761 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:20:13,762 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:20:13,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5050 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=609, Invalid=41211, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:20:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:20:13,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-09-26 08:20:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:20:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-09-26 08:20:13,892 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-09-26 08:20:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:13,892 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-09-26 08:20:13,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:20:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-09-26 08:20:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:20:13,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:13,893 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-09-26 08:20:13,893 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:13,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:13,893 INFO L82 PathProgramCache]: Analyzing trace with hash -838117007, now seen corresponding path program 101 times [2018-09-26 08:20:13,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:15,782 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:15,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:20:15,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:20:15,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:20:15,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=10920, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:20:15,784 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 106 states. [2018-09-26 08:20:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:20,081 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-26 08:20:20,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-09-26 08:20:20,081 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 206 [2018-09-26 08:20:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:20,082 INFO L225 Difference]: With dead ends: 211 [2018-09-26 08:20:20,082 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:20:20,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5151 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=615, Invalid=42027, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:20:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:20:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-09-26 08:20:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:20:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-26 08:20:20,211 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-09-26 08:20:20,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:20,211 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-26 08:20:20,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:20:20,212 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-26 08:20:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:20:20,212 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:20,212 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-09-26 08:20:20,212 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:20,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:20,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2023340909, now seen corresponding path program 102 times [2018-09-26 08:20:20,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:22,168 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:22,168 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:20:22,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:20:22,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:20:22,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=11130, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:20:22,170 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 107 states. [2018-09-26 08:20:26,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:26,477 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-09-26 08:20:26,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-09-26 08:20:26,477 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 208 [2018-09-26 08:20:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:26,478 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:20:26,478 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:20:26,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5253 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=621, Invalid=42851, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:20:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:20:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-26 08:20:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:20:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-26 08:20:26,610 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-09-26 08:20:26,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:26,611 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-26 08:20:26,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:20:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-26 08:20:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:20:26,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:26,612 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-09-26 08:20:26,612 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:26,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:26,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1189638551, now seen corresponding path program 103 times [2018-09-26 08:20:26,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:28,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:28,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:20:28,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:20:28,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:20:28,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=11342, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:20:28,549 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 108 states. Received shutdown request... [2018-09-26 08:20:30,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:20:30,387 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:20:30,400 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:20:30,400 INFO L202 PluginConnector]: Adding new model jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:20:30 BoogieIcfgContainer [2018-09-26 08:20:30,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:20:30,402 INFO L168 Benchmark]: Toolchain (without parser) took 244897.59 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -878.4 MB). Peak memory consumption was 415.0 MB. Max. memory is 7.1 GB. [2018-09-26 08:20:30,404 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:20:30,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.67 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:20:30,405 INFO L168 Benchmark]: Boogie Preprocessor took 23.33 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:20:30,405 INFO L168 Benchmark]: RCFGBuilder took 261.91 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:20:30,407 INFO L168 Benchmark]: TraceAbstraction took 244560.47 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -888.9 MB). Peak memory consumption was 404.5 MB. Max. memory is 7.1 GB. [2018-09-26 08:20:30,410 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.33 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 261.91 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 244560.47 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -888.9 MB). Peak memory consumption was 404.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while BasicCegarLoop was constructing difference of abstraction (211states) and FLOYD_HOARE automaton (currently 76 states, 108 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 244.4s OverallTime, 104 OverallIterations, 104 TraceHistogramMax, 166.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4242 SDtfs, 1491 SDslu, 281336 SDs, 0 SdLazy, 488356 SolverSat, 5499 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 90.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11065 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10961 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183027 ImplicationChecksByTransitivity, 81.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=103, 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: 5.5s AutomataMinimizationTime, 103 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 8.2s SatisfiabilityAnalysisTime, 59.9s InterpolantComputationTime, 11128 NumberOfCodeBlocks, 11128 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 11024 ConstructedInterpolants, 0 QuantifiedInterpolants, 22865324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 104 InterpolantComputations, 1 PerfectInterpolantSequences, 0/374920 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/jain_5.i_2.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-20-30-423.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/jain_5.i_2.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-20-30-423.csv Completed graceful shutdown