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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/string_concat-noarr_true-unreach-call_true-termination.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:44:42,055 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:44:42,057 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:44:42,069 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:44:42,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:44:42,070 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:44:42,071 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:44:42,073 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:44:42,075 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:44:42,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:44:42,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:44:42,077 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:44:42,078 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:44:42,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:44:42,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:44:42,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:44:42,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:44:42,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:44:42,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:44:42,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:44:42,089 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:44:42,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:44:42,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:44:42,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:44:42,093 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:44:42,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:44:42,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:44:42,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:44:42,101 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:44:42,106 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:44:42,106 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:44:42,108 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:44:42,108 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:44:42,108 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:44:42,109 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:44:42,112 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:44:42,112 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 12:44:42,126 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:44:42,126 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:44:42,127 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:44:42,127 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:44:42,127 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:44:42,127 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:44:42,128 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:44:42,128 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:44:42,129 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:44:42,129 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:44:42,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:44:42,129 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:44:42,129 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:44:42,130 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:44:42,130 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:44:42,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:44:42,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:44:42,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:44:42,197 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:44:42,197 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:44:42,198 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/string_concat-noarr_true-unreach-call_true-termination.i_5.bpl [2018-10-15 12:44:42,198 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/string_concat-noarr_true-unreach-call_true-termination.i_5.bpl' [2018-10-15 12:44:42,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:44:42,245 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:44:42,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:44:42,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:44:42,246 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:44:42,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:44:42" (1/1) ... [2018-10-15 12:44:42,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:44:42" (1/1) ... [2018-10-15 12:44:42,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:44:42" (1/1) ... [2018-10-15 12:44:42,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:44:42" (1/1) ... [2018-10-15 12:44:42,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:44:42" (1/1) ... [2018-10-15 12:44:42,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:44:42" (1/1) ... [2018-10-15 12:44:42,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:44:42" (1/1) ... [2018-10-15 12:44:42,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:44:42,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:44:42,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:44:42,295 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:44:42,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:44:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 12:44:42,368 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:44:42,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:44:42,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:44:42,857 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:44:42,858 INFO L202 PluginConnector]: Adding new model string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:44:42 BoogieIcfgContainer [2018-10-15 12:44:42,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:44:42,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:44:42,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:44:42,863 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:44:42,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:44:42" (1/2) ... [2018-10-15 12:44:42,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310e76ef and model type string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:44:42, skipping insertion in model container [2018-10-15 12:44:42,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:44:42" (2/2) ... [2018-10-15 12:44:42,867 INFO L112 eAbstractionObserver]: Analyzing ICFG string_concat-noarr_true-unreach-call_true-termination.i_5.bpl [2018-10-15 12:44:42,876 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:44:42,886 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:44:42,906 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:44:42,933 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:44:42,933 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:44:42,934 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:44:42,934 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:44:42,934 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:44:42,934 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:44:42,935 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:44:42,935 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:44:42,935 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:44:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-10-15 12:44:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 12:44:42,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:42,962 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:42,963 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:42,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:42,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1967621060, now seen corresponding path program 1 times [2018-10-15 12:44:43,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:43,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:44:43,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 12:44:43,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:44:43,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:44:43,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:44:43,234 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-10-15 12:44:43,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:43,412 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-10-15 12:44:43,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 12:44:43,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-15 12:44:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:43,426 INFO L225 Difference]: With dead ends: 50 [2018-10-15 12:44:43,426 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 12:44:43,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:44:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 12:44:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-10-15 12:44:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 12:44:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-10-15 12:44:43,465 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 19 [2018-10-15 12:44:43,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:43,465 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-10-15 12:44:43,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:44:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-10-15 12:44:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-15 12:44:43,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:43,467 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:43,467 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:43,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:43,468 INFO L82 PathProgramCache]: Analyzing trace with hash 804781191, now seen corresponding path program 1 times [2018-10-15 12:44:43,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 12:44:43,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:44:43,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 12:44:43,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:44:43,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:44:43,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:44:43,560 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-10-15 12:44:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:43,931 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-10-15 12:44:43,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 12:44:43,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-15 12:44:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:43,934 INFO L225 Difference]: With dead ends: 52 [2018-10-15 12:44:43,934 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 12:44:43,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:44:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 12:44:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2018-10-15 12:44:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 12:44:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-10-15 12:44:43,945 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 25 [2018-10-15 12:44:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:43,946 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-10-15 12:44:43,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:44:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-10-15 12:44:43,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 12:44:43,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:43,948 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:43,948 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:43,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1781487695, now seen corresponding path program 1 times [2018-10-15 12:44:43,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:44,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:44,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:44:44,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:44:44,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:44:44,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:44:44,164 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 7 states. [2018-10-15 12:44:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:44,425 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-10-15 12:44:44,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 12:44:44,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-10-15 12:44:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:44,429 INFO L225 Difference]: With dead ends: 61 [2018-10-15 12:44:44,429 INFO L226 Difference]: Without dead ends: 55 [2018-10-15 12:44:44,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:44:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-15 12:44:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-10-15 12:44:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 12:44:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-10-15 12:44:44,437 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 28 [2018-10-15 12:44:44,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:44,439 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-10-15 12:44:44,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:44:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-10-15 12:44:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 12:44:44,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:44,441 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:44,441 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:44,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:44,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1316664378, now seen corresponding path program 1 times [2018-10-15 12:44:44,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:44,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:44,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:44:44,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:44:44,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:44:44,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:44:44,653 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 9 states. [2018-10-15 12:44:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:45,139 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-10-15 12:44:45,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:44:45,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-10-15 12:44:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:45,142 INFO L225 Difference]: With dead ends: 81 [2018-10-15 12:44:45,142 INFO L226 Difference]: Without dead ends: 75 [2018-10-15 12:44:45,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:44:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-15 12:44:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2018-10-15 12:44:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 12:44:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-10-15 12:44:45,150 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 34 [2018-10-15 12:44:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:45,150 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-10-15 12:44:45,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:44:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-10-15 12:44:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 12:44:45,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:45,152 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:45,152 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:45,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:45,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2125885476, now seen corresponding path program 2 times [2018-10-15 12:44:45,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:45,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:45,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:44:45,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:44:45,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:44:45,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:44:45,298 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 9 states. [2018-10-15 12:44:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:45,847 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-10-15 12:44:45,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 12:44:45,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-10-15 12:44:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:45,850 INFO L225 Difference]: With dead ends: 85 [2018-10-15 12:44:45,850 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 12:44:45,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:44:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 12:44:45,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-10-15 12:44:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 12:44:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-10-15 12:44:45,858 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 37 [2018-10-15 12:44:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:45,859 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-10-15 12:44:45,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:44:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-10-15 12:44:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 12:44:45,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:45,861 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:45,861 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:45,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:45,861 INFO L82 PathProgramCache]: Analyzing trace with hash 185715739, now seen corresponding path program 2 times [2018-10-15 12:44:45,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-15 12:44:45,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:45,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:44:45,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:44:45,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:44:45,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:44:45,950 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 7 states. [2018-10-15 12:44:46,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:46,153 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-10-15 12:44:46,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 12:44:46,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-10-15 12:44:46,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:46,155 INFO L225 Difference]: With dead ends: 96 [2018-10-15 12:44:46,155 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 12:44:46,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:44:46,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 12:44:46,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2018-10-15 12:44:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 12:44:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-10-15 12:44:46,162 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 40 [2018-10-15 12:44:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:46,164 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-10-15 12:44:46,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:44:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-10-15 12:44:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-15 12:44:46,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:46,165 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:46,166 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:46,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:46,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1720955751, now seen corresponding path program 3 times [2018-10-15 12:44:46,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:46,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:46,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:44:46,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:44:46,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:44:46,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:44:46,410 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 11 states. [2018-10-15 12:44:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:46,825 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-10-15 12:44:46,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:44:46,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-10-15 12:44:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:46,827 INFO L225 Difference]: With dead ends: 108 [2018-10-15 12:44:46,827 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 12:44:46,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:44:46,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 12:44:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 62. [2018-10-15 12:44:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-15 12:44:46,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-10-15 12:44:46,837 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 43 [2018-10-15 12:44:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:46,838 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-10-15 12:44:46,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:44:46,838 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-10-15 12:44:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 12:44:46,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:46,839 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:46,839 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:46,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:46,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1817466863, now seen corresponding path program 3 times [2018-10-15 12:44:46,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:46,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:46,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:44:46,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:44:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:44:46,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:44:46,959 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 11 states. [2018-10-15 12:44:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:47,226 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2018-10-15 12:44:47,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 12:44:47,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-10-15 12:44:47,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:47,229 INFO L225 Difference]: With dead ends: 103 [2018-10-15 12:44:47,229 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 12:44:47,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:44:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 12:44:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2018-10-15 12:44:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-15 12:44:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-10-15 12:44:47,235 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 46 [2018-10-15 12:44:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:47,235 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-10-15 12:44:47,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:44:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-10-15 12:44:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 12:44:47,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:47,237 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:47,237 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:47,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:47,238 INFO L82 PathProgramCache]: Analyzing trace with hash -545668430, now seen corresponding path program 4 times [2018-10-15 12:44:47,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:47,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:47,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:44:47,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:44:47,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:44:47,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:44:47,393 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 13 states. [2018-10-15 12:44:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:47,721 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2018-10-15 12:44:47,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 12:44:47,721 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-10-15 12:44:47,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:47,723 INFO L225 Difference]: With dead ends: 140 [2018-10-15 12:44:47,723 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 12:44:47,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:44:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 12:44:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 80. [2018-10-15 12:44:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 12:44:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-10-15 12:44:47,730 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 49 [2018-10-15 12:44:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:47,730 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-10-15 12:44:47,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:44:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-10-15 12:44:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 12:44:47,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:47,732 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:47,733 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:47,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:47,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1342615322, now seen corresponding path program 5 times [2018-10-15 12:44:47,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:47,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:47,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:44:47,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:44:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:44:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:44:47,877 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 13 states. [2018-10-15 12:44:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:48,293 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-10-15 12:44:48,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:44:48,293 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-10-15 12:44:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:48,295 INFO L225 Difference]: With dead ends: 141 [2018-10-15 12:44:48,295 INFO L226 Difference]: Without dead ends: 135 [2018-10-15 12:44:48,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:44:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-15 12:44:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 80. [2018-10-15 12:44:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 12:44:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-10-15 12:44:48,302 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 52 [2018-10-15 12:44:48,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:48,303 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-10-15 12:44:48,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:44:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-10-15 12:44:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 12:44:48,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:48,304 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:48,305 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:48,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:48,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2057766020, now seen corresponding path program 4 times [2018-10-15 12:44:48,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:48,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:48,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:44:48,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:44:48,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:44:48,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:44:48,467 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 13 states. [2018-10-15 12:44:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:48,865 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-10-15 12:44:48,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 12:44:48,866 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-10-15 12:44:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:48,867 INFO L225 Difference]: With dead ends: 130 [2018-10-15 12:44:48,867 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 12:44:48,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:44:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 12:44:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 92. [2018-10-15 12:44:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-15 12:44:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-10-15 12:44:48,874 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 55 [2018-10-15 12:44:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:48,874 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-10-15 12:44:48,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:44:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-10-15 12:44:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 12:44:48,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:48,877 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:48,878 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:48,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1865683523, now seen corresponding path program 6 times [2018-10-15 12:44:48,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:49,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:49,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:44:49,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:44:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:44:49,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:44:49,349 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 15 states. [2018-10-15 12:44:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:49,878 INFO L93 Difference]: Finished difference Result 176 states and 181 transitions. [2018-10-15 12:44:49,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 12:44:49,879 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-10-15 12:44:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:49,881 INFO L225 Difference]: With dead ends: 176 [2018-10-15 12:44:49,881 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 12:44:49,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:44:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 12:44:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 98. [2018-10-15 12:44:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-15 12:44:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-10-15 12:44:49,886 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 55 [2018-10-15 12:44:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:49,886 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-10-15 12:44:49,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:44:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-10-15 12:44:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 12:44:49,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:49,888 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:49,888 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:49,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1191688709, now seen corresponding path program 7 times [2018-10-15 12:44:49,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:50,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:50,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:44:50,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:44:50,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:44:50,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:44:50,054 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 15 states. [2018-10-15 12:44:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:50,333 INFO L93 Difference]: Finished difference Result 182 states and 187 transitions. [2018-10-15 12:44:50,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 12:44:50,333 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-10-15 12:44:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:50,335 INFO L225 Difference]: With dead ends: 182 [2018-10-15 12:44:50,335 INFO L226 Difference]: Without dead ends: 176 [2018-10-15 12:44:50,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=628, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:44:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-15 12:44:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 98. [2018-10-15 12:44:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-15 12:44:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-10-15 12:44:50,340 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 58 [2018-10-15 12:44:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:50,341 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-10-15 12:44:50,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:44:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-10-15 12:44:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-15 12:44:50,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:50,342 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:50,343 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:50,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:50,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1661170247, now seen corresponding path program 8 times [2018-10-15 12:44:50,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:50,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:50,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:44:50,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:44:50,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:44:50,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:44:50,474 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 15 states. [2018-10-15 12:44:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:50,772 INFO L93 Difference]: Finished difference Result 177 states and 182 transitions. [2018-10-15 12:44:50,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:44:50,773 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-10-15 12:44:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:50,774 INFO L225 Difference]: With dead ends: 177 [2018-10-15 12:44:50,775 INFO L226 Difference]: Without dead ends: 171 [2018-10-15 12:44:50,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:44:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-15 12:44:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2018-10-15 12:44:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-15 12:44:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-10-15 12:44:50,779 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 61 [2018-10-15 12:44:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:50,779 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-10-15 12:44:50,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:44:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-10-15 12:44:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-15 12:44:50,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:50,781 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:50,781 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:50,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:50,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1853252744, now seen corresponding path program 9 times [2018-10-15 12:44:50,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:50,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:50,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:44:50,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:44:50,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:44:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:44:50,947 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 17 states. [2018-10-15 12:44:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:51,835 INFO L93 Difference]: Finished difference Result 190 states and 196 transitions. [2018-10-15 12:44:51,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:44:51,835 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-10-15 12:44:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:51,836 INFO L225 Difference]: With dead ends: 190 [2018-10-15 12:44:51,837 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 12:44:51,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=929, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:44:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 12:44:51,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 104. [2018-10-15 12:44:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-15 12:44:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2018-10-15 12:44:51,841 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 61 [2018-10-15 12:44:51,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:51,841 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2018-10-15 12:44:51,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:44:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2018-10-15 12:44:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 12:44:51,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:51,842 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:51,843 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:51,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:51,843 INFO L82 PathProgramCache]: Analyzing trace with hash 279662705, now seen corresponding path program 5 times [2018-10-15 12:44:51,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:52,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:52,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:44:52,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:44:52,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:44:52,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:44:52,086 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 15 states. [2018-10-15 12:44:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:52,321 INFO L93 Difference]: Finished difference Result 163 states and 169 transitions. [2018-10-15 12:44:52,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 12:44:52,322 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2018-10-15 12:44:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:52,323 INFO L225 Difference]: With dead ends: 163 [2018-10-15 12:44:52,323 INFO L226 Difference]: Without dead ends: 157 [2018-10-15 12:44:52,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:44:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-15 12:44:52,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2018-10-15 12:44:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-15 12:44:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-10-15 12:44:52,328 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 64 [2018-10-15 12:44:52,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:52,328 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-10-15 12:44:52,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:44:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-10-15 12:44:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 12:44:52,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:52,329 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:52,329 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:52,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:52,330 INFO L82 PathProgramCache]: Analyzing trace with hash 957241168, now seen corresponding path program 10 times [2018-10-15 12:44:52,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:52,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:52,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:44:52,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:44:52,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:44:52,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:44:52,497 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 17 states. [2018-10-15 12:44:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:52,796 INFO L93 Difference]: Finished difference Result 223 states and 229 transitions. [2018-10-15 12:44:52,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 12:44:52,796 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-10-15 12:44:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:52,798 INFO L225 Difference]: With dead ends: 223 [2018-10-15 12:44:52,798 INFO L226 Difference]: Without dead ends: 217 [2018-10-15 12:44:52,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:44:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-15 12:44:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 116. [2018-10-15 12:44:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-15 12:44:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-10-15 12:44:52,803 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 64 [2018-10-15 12:44:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:52,803 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-10-15 12:44:52,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:44:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-10-15 12:44:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-15 12:44:52,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:52,805 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:52,805 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:52,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash -351378222, now seen corresponding path program 11 times [2018-10-15 12:44:52,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:53,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:53,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:44:53,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:44:53,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:44:53,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:44:53,597 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 17 states. [2018-10-15 12:44:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:53,915 INFO L93 Difference]: Finished difference Result 227 states and 233 transitions. [2018-10-15 12:44:53,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 12:44:53,916 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-10-15 12:44:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:53,917 INFO L225 Difference]: With dead ends: 227 [2018-10-15 12:44:53,917 INFO L226 Difference]: Without dead ends: 221 [2018-10-15 12:44:53,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:44:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-15 12:44:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 116. [2018-10-15 12:44:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-15 12:44:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-10-15 12:44:53,922 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 67 [2018-10-15 12:44:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:53,922 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-10-15 12:44:53,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:44:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-10-15 12:44:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-15 12:44:53,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:53,923 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:53,924 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:53,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:53,924 INFO L82 PathProgramCache]: Analyzing trace with hash -159295725, now seen corresponding path program 12 times [2018-10-15 12:44:53,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:54,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:54,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:44:54,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:44:54,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:44:54,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:44:54,103 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 19 states. [2018-10-15 12:44:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:54,564 INFO L93 Difference]: Finished difference Result 231 states and 238 transitions. [2018-10-15 12:44:54,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:44:54,565 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-10-15 12:44:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:54,567 INFO L225 Difference]: With dead ends: 231 [2018-10-15 12:44:54,567 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 12:44:54,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=1218, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:44:54,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 12:44:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 122. [2018-10-15 12:44:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-15 12:44:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-10-15 12:44:54,574 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 67 [2018-10-15 12:44:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:54,574 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-10-15 12:44:54,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:44:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-10-15 12:44:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 12:44:54,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:54,575 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:54,576 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:54,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:54,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2103292410, now seen corresponding path program 13 times [2018-10-15 12:44:54,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:54,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:54,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:44:54,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:44:54,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:44:54,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:44:54,879 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 17 states. [2018-10-15 12:44:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:55,364 INFO L93 Difference]: Finished difference Result 219 states and 226 transitions. [2018-10-15 12:44:55,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:44:55,365 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-10-15 12:44:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:55,366 INFO L225 Difference]: With dead ends: 219 [2018-10-15 12:44:55,366 INFO L226 Difference]: Without dead ends: 213 [2018-10-15 12:44:55,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:44:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-15 12:44:55,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 122. [2018-10-15 12:44:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-15 12:44:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-10-15 12:44:55,371 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 70 [2018-10-15 12:44:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:55,372 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-10-15 12:44:55,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:44:55,372 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-10-15 12:44:55,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 12:44:55,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:55,373 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:55,373 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:55,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:55,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1425713947, now seen corresponding path program 14 times [2018-10-15 12:44:55,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:55,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:55,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:44:55,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:44:55,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:44:55,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:44:55,568 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 19 states. [2018-10-15 12:44:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:55,972 INFO L93 Difference]: Finished difference Result 237 states and 244 transitions. [2018-10-15 12:44:55,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:44:55,972 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-10-15 12:44:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:55,974 INFO L225 Difference]: With dead ends: 237 [2018-10-15 12:44:55,974 INFO L226 Difference]: Without dead ends: 231 [2018-10-15 12:44:55,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=324, Invalid=1158, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:44:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-15 12:44:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 122. [2018-10-15 12:44:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-15 12:44:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-10-15 12:44:55,979 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 70 [2018-10-15 12:44:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:55,979 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-10-15 12:44:55,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:44:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-10-15 12:44:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 12:44:55,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:55,980 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:55,980 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:55,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:55,981 INFO L82 PathProgramCache]: Analyzing trace with hash 83935004, now seen corresponding path program 6 times [2018-10-15 12:44:55,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:56,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:56,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:44:56,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:44:56,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:44:56,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:44:56,401 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 17 states. [2018-10-15 12:44:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:56,717 INFO L93 Difference]: Finished difference Result 190 states and 197 transitions. [2018-10-15 12:44:56,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 12:44:56,723 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-10-15 12:44:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:56,724 INFO L225 Difference]: With dead ends: 190 [2018-10-15 12:44:56,724 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 12:44:56,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:44:56,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 12:44:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 134. [2018-10-15 12:44:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-15 12:44:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2018-10-15 12:44:56,728 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 73 [2018-10-15 12:44:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:56,728 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2018-10-15 12:44:56,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:44:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2018-10-15 12:44:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 12:44:56,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:56,729 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:56,729 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:56,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:56,730 INFO L82 PathProgramCache]: Analyzing trace with hash 547226397, now seen corresponding path program 15 times [2018-10-15 12:44:56,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:57,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:57,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:44:57,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:44:57,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:44:57,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:44:57,120 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 19 states. [2018-10-15 12:44:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:58,961 INFO L93 Difference]: Finished difference Result 277 states and 284 transitions. [2018-10-15 12:44:58,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 12:44:58,962 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-10-15 12:44:58,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:58,963 INFO L225 Difference]: With dead ends: 277 [2018-10-15 12:44:58,963 INFO L226 Difference]: Without dead ends: 271 [2018-10-15 12:44:58,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=314, Invalid=1092, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:44:58,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-15 12:44:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 134. [2018-10-15 12:44:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-15 12:44:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2018-10-15 12:44:58,968 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 73 [2018-10-15 12:44:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:58,968 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2018-10-15 12:44:58,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:44:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2018-10-15 12:44:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 12:44:58,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:58,969 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:58,969 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:58,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:58,970 INFO L82 PathProgramCache]: Analyzing trace with hash 739308894, now seen corresponding path program 16 times [2018-10-15 12:44:58,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:59,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:59,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:44:59,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:44:59,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:44:59,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:44:59,243 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 21 states. [2018-10-15 12:44:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:59,739 INFO L93 Difference]: Finished difference Result 272 states and 280 transitions. [2018-10-15 12:44:59,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 12:44:59,739 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 73 [2018-10-15 12:44:59,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:59,741 INFO L225 Difference]: With dead ends: 272 [2018-10-15 12:44:59,741 INFO L226 Difference]: Without dead ends: 266 [2018-10-15 12:44:59,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=1545, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:44:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-15 12:44:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 140. [2018-10-15 12:44:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 12:44:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-10-15 12:44:59,747 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 73 [2018-10-15 12:44:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:59,747 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-10-15 12:44:59,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:44:59,748 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-10-15 12:44:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-15 12:44:59,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:59,748 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:59,749 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:59,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:59,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1990723547, now seen corresponding path program 17 times [2018-10-15 12:44:59,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:00,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:00,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:45:00,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:45:00,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:45:00,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:45:00,106 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 19 states. [2018-10-15 12:45:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:00,653 INFO L93 Difference]: Finished difference Result 278 states and 286 transitions. [2018-10-15 12:45:00,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 12:45:00,653 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-10-15 12:45:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:00,656 INFO L225 Difference]: With dead ends: 278 [2018-10-15 12:45:00,656 INFO L226 Difference]: Without dead ends: 272 [2018-10-15 12:45:00,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:45:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-15 12:45:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 140. [2018-10-15 12:45:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 12:45:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-10-15 12:45:00,660 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 76 [2018-10-15 12:45:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:00,661 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-10-15 12:45:00,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:45:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-10-15 12:45:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-15 12:45:00,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:00,662 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:00,662 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:00,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:00,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1626665286, now seen corresponding path program 18 times [2018-10-15 12:45:00,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:00,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:00,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:45:00,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:45:00,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:45:00,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:45:00,942 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 21 states. [2018-10-15 12:45:01,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:01,542 INFO L93 Difference]: Finished difference Result 282 states and 290 transitions. [2018-10-15 12:45:01,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 12:45:01,544 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-10-15 12:45:01,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:01,547 INFO L225 Difference]: With dead ends: 282 [2018-10-15 12:45:01,547 INFO L226 Difference]: Without dead ends: 276 [2018-10-15 12:45:01,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=412, Invalid=1480, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:45:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-15 12:45:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 140. [2018-10-15 12:45:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 12:45:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-10-15 12:45:01,552 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 76 [2018-10-15 12:45:01,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:01,552 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-10-15 12:45:01,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:45:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-10-15 12:45:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:45:01,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:01,553 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:01,554 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:01,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:01,554 INFO L82 PathProgramCache]: Analyzing trace with hash 727005479, now seen corresponding path program 19 times [2018-10-15 12:45:01,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:02,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:02,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:45:02,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:45:02,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:45:02,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:45:02,107 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 19 states. [2018-10-15 12:45:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:02,408 INFO L93 Difference]: Finished difference Result 255 states and 263 transitions. [2018-10-15 12:45:02,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:45:02,409 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 79 [2018-10-15 12:45:02,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:02,411 INFO L225 Difference]: With dead ends: 255 [2018-10-15 12:45:02,411 INFO L226 Difference]: Without dead ends: 249 [2018-10-15 12:45:02,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=942, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:45:02,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-15 12:45:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 140. [2018-10-15 12:45:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 12:45:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-10-15 12:45:02,416 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 79 [2018-10-15 12:45:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:02,416 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-10-15 12:45:02,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:45:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-10-15 12:45:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:45:02,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:02,417 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:02,417 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:02,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:02,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1190296872, now seen corresponding path program 20 times [2018-10-15 12:45:02,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:02,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:02,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:45:02,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:45:02,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:45:02,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:45:02,618 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 21 states. [2018-10-15 12:45:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:02,989 INFO L93 Difference]: Finished difference Result 291 states and 299 transitions. [2018-10-15 12:45:02,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:45:02,989 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2018-10-15 12:45:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:02,991 INFO L225 Difference]: With dead ends: 291 [2018-10-15 12:45:02,991 INFO L226 Difference]: Without dead ends: 285 [2018-10-15 12:45:02,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1409, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:45:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-15 12:45:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 140. [2018-10-15 12:45:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 12:45:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-10-15 12:45:02,996 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 79 [2018-10-15 12:45:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:02,996 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-10-15 12:45:02,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:45:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-10-15 12:45:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:45:02,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:02,997 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:02,997 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:02,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:02,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1382379369, now seen corresponding path program 21 times [2018-10-15 12:45:02,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:04,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:04,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:45:04,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:45:04,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:45:04,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:45:04,099 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 23 states. [2018-10-15 12:45:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:04,694 INFO L93 Difference]: Finished difference Result 286 states and 295 transitions. [2018-10-15 12:45:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:45:04,694 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2018-10-15 12:45:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:04,696 INFO L225 Difference]: With dead ends: 286 [2018-10-15 12:45:04,696 INFO L226 Difference]: Without dead ends: 280 [2018-10-15 12:45:04,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=540, Invalid=1910, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:45:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-15 12:45:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 146. [2018-10-15 12:45:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 12:45:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-10-15 12:45:04,701 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 79 [2018-10-15 12:45:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:04,702 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-10-15 12:45:04,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:45:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-10-15 12:45:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:45:04,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:04,702 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:04,703 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:04,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:04,703 INFO L82 PathProgramCache]: Analyzing trace with hash -604659503, now seen corresponding path program 7 times [2018-10-15 12:45:04,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:04,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:04,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:45:04,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:45:04,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:45:04,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:45:04,996 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 19 states. [2018-10-15 12:45:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:06,954 INFO L93 Difference]: Finished difference Result 223 states and 232 transitions. [2018-10-15 12:45:06,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 12:45:06,955 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-10-15 12:45:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:06,956 INFO L225 Difference]: With dead ends: 223 [2018-10-15 12:45:06,956 INFO L226 Difference]: Without dead ends: 217 [2018-10-15 12:45:06,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=332, Invalid=858, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:45:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-15 12:45:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 158. [2018-10-15 12:45:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 12:45:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2018-10-15 12:45:06,961 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 82 [2018-10-15 12:45:06,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:06,961 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2018-10-15 12:45:06,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:45:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2018-10-15 12:45:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:45:06,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:06,962 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:06,962 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:06,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:06,963 INFO L82 PathProgramCache]: Analyzing trace with hash -145863184, now seen corresponding path program 22 times [2018-10-15 12:45:06,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:07,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:07,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:45:07,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:45:07,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:45:07,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:45:07,275 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 21 states. [2018-10-15 12:45:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:07,722 INFO L93 Difference]: Finished difference Result 337 states and 346 transitions. [2018-10-15 12:45:07,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 12:45:07,723 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-10-15 12:45:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:07,725 INFO L225 Difference]: With dead ends: 337 [2018-10-15 12:45:07,725 INFO L226 Difference]: Without dead ends: 331 [2018-10-15 12:45:07,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=390, Invalid=1332, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:45:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-15 12:45:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 158. [2018-10-15 12:45:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 12:45:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2018-10-15 12:45:07,730 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 82 [2018-10-15 12:45:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:07,730 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2018-10-15 12:45:07,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:45:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2018-10-15 12:45:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:45:07,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:07,731 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:07,732 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:07,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash 531715279, now seen corresponding path program 23 times [2018-10-15 12:45:07,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:07,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:07,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:45:07,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:45:07,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:45:07,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:45:07,928 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 23 states. [2018-10-15 12:45:08,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:08,555 INFO L93 Difference]: Finished difference Result 332 states and 341 transitions. [2018-10-15 12:45:08,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:45:08,556 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 82 [2018-10-15 12:45:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:08,558 INFO L225 Difference]: With dead ends: 332 [2018-10-15 12:45:08,558 INFO L226 Difference]: Without dead ends: 326 [2018-10-15 12:45:08,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=512, Invalid=1840, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:45:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-15 12:45:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 158. [2018-10-15 12:45:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 12:45:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2018-10-15 12:45:08,563 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 82 [2018-10-15 12:45:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:08,563 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2018-10-15 12:45:08,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:45:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2018-10-15 12:45:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 12:45:08,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:08,564 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:08,564 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:08,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:08,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1087028978, now seen corresponding path program 24 times [2018-10-15 12:45:08,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:09,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:09,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:45:09,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:45:09,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:45:09,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:45:09,126 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 21 states. [2018-10-15 12:45:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:09,525 INFO L93 Difference]: Finished difference Result 323 states and 332 transitions. [2018-10-15 12:45:09,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:45:09,525 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2018-10-15 12:45:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:09,528 INFO L225 Difference]: With dead ends: 323 [2018-10-15 12:45:09,528 INFO L226 Difference]: Without dead ends: 317 [2018-10-15 12:45:09,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:45:09,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-15 12:45:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 158. [2018-10-15 12:45:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 12:45:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2018-10-15 12:45:09,533 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 85 [2018-10-15 12:45:09,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:09,534 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2018-10-15 12:45:09,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:45:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2018-10-15 12:45:09,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 12:45:09,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:09,535 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:09,535 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:09,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:09,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1550320371, now seen corresponding path program 25 times [2018-10-15 12:45:09,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:09,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:09,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:45:09,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:45:09,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:45:09,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:45:09,793 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 23 states. [2018-10-15 12:45:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:10,485 INFO L93 Difference]: Finished difference Result 341 states and 350 transitions. [2018-10-15 12:45:10,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 12:45:10,485 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-10-15 12:45:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:10,488 INFO L225 Difference]: With dead ends: 341 [2018-10-15 12:45:10,488 INFO L226 Difference]: Without dead ends: 335 [2018-10-15 12:45:10,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=492, Invalid=1764, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:45:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-15 12:45:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 158. [2018-10-15 12:45:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 12:45:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2018-10-15 12:45:10,493 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 85 [2018-10-15 12:45:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:10,493 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2018-10-15 12:45:10,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:45:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2018-10-15 12:45:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 12:45:10,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:10,494 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:10,494 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:10,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:10,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1742402868, now seen corresponding path program 26 times [2018-10-15 12:45:10,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:10,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:10,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:45:10,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:45:10,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:45:10,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:45:10,809 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 25 states. [2018-10-15 12:45:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:11,432 INFO L93 Difference]: Finished difference Result 327 states and 337 transitions. [2018-10-15 12:45:11,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 12:45:11,432 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2018-10-15 12:45:11,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:11,434 INFO L225 Difference]: With dead ends: 327 [2018-10-15 12:45:11,434 INFO L226 Difference]: Without dead ends: 321 [2018-10-15 12:45:11,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=657, Invalid=2313, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:45:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-15 12:45:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 164. [2018-10-15 12:45:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 12:45:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-10-15 12:45:11,439 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 85 [2018-10-15 12:45:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:11,439 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-10-15 12:45:11,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:45:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-10-15 12:45:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 12:45:11,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:11,440 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:11,441 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:11,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash 322061094, now seen corresponding path program 27 times [2018-10-15 12:45:11,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:12,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:12,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:45:12,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:45:12,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:45:12,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:45:12,257 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 21 states. [2018-10-15 12:45:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:12,747 INFO L93 Difference]: Finished difference Result 297 states and 307 transitions. [2018-10-15 12:45:12,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:45:12,747 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2018-10-15 12:45:12,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:12,749 INFO L225 Difference]: With dead ends: 297 [2018-10-15 12:45:12,749 INFO L226 Difference]: Without dead ends: 291 [2018-10-15 12:45:12,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=400, Invalid=1160, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:45:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-15 12:45:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 164. [2018-10-15 12:45:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 12:45:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-10-15 12:45:12,754 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 88 [2018-10-15 12:45:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:12,754 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-10-15 12:45:12,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:45:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-10-15 12:45:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 12:45:12,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:12,755 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:12,756 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:12,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash 780857413, now seen corresponding path program 28 times [2018-10-15 12:45:12,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:13,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:13,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:45:13,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:45:13,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:45:13,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:45:13,148 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 23 states. [2018-10-15 12:45:13,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:13,697 INFO L93 Difference]: Finished difference Result 351 states and 361 transitions. [2018-10-15 12:45:13,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:45:13,697 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 88 [2018-10-15 12:45:13,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:13,699 INFO L225 Difference]: With dead ends: 351 [2018-10-15 12:45:13,699 INFO L226 Difference]: Without dead ends: 345 [2018-10-15 12:45:13,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=480, Invalid=1682, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:45:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-15 12:45:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 164. [2018-10-15 12:45:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 12:45:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-10-15 12:45:13,704 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 88 [2018-10-15 12:45:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:13,705 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-10-15 12:45:13,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:45:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-10-15 12:45:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 12:45:13,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:13,706 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:13,706 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:13,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:13,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1458435876, now seen corresponding path program 29 times [2018-10-15 12:45:13,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:13,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:13,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:45:13,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:45:13,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:45:13,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:45:13,962 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 25 states. [2018-10-15 12:45:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:14,565 INFO L93 Difference]: Finished difference Result 346 states and 356 transitions. [2018-10-15 12:45:14,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:45:14,566 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-10-15 12:45:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:14,567 INFO L225 Difference]: With dead ends: 346 [2018-10-15 12:45:14,568 INFO L226 Difference]: Without dead ends: 340 [2018-10-15 12:45:14,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=624, Invalid=2238, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 12:45:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-15 12:45:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 164. [2018-10-15 12:45:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 12:45:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-10-15 12:45:14,571 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 88 [2018-10-15 12:45:14,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:14,572 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-10-15 12:45:14,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:45:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-10-15 12:45:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 12:45:14,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:14,572 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:14,572 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:14,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:14,573 INFO L82 PathProgramCache]: Analyzing trace with hash -606414148, now seen corresponding path program 8 times [2018-10-15 12:45:14,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:15,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:15,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:45:15,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:45:15,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:45:15,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:45:15,346 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 21 states. [2018-10-15 12:45:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:15,691 INFO L93 Difference]: Finished difference Result 250 states and 260 transitions. [2018-10-15 12:45:15,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 12:45:15,692 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 91 [2018-10-15 12:45:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:15,693 INFO L225 Difference]: With dead ends: 250 [2018-10-15 12:45:15,693 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 12:45:15,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:45:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 12:45:15,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 176. [2018-10-15 12:45:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 12:45:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-10-15 12:45:15,697 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 91 [2018-10-15 12:45:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:15,697 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-10-15 12:45:15,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:45:15,698 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-10-15 12:45:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 12:45:15,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:15,698 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:15,699 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:15,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash 970555517, now seen corresponding path program 30 times [2018-10-15 12:45:15,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:16,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:16,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:45:16,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:45:16,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:45:16,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:45:16,110 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 23 states. [2018-10-15 12:45:16,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:16,534 INFO L93 Difference]: Finished difference Result 391 states and 401 transitions. [2018-10-15 12:45:16,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 12:45:16,534 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-10-15 12:45:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:16,536 INFO L225 Difference]: With dead ends: 391 [2018-10-15 12:45:16,536 INFO L226 Difference]: Without dead ends: 385 [2018-10-15 12:45:16,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=476, Invalid=1594, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:45:16,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-15 12:45:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 176. [2018-10-15 12:45:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 12:45:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-10-15 12:45:16,541 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 91 [2018-10-15 12:45:16,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:16,542 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-10-15 12:45:16,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:45:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-10-15 12:45:16,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 12:45:16,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:16,543 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:16,543 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:16,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:16,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1433846910, now seen corresponding path program 31 times [2018-10-15 12:45:16,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:17,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:17,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:45:17,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:45:17,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:45:17,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:45:17,062 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 25 states. [2018-10-15 12:45:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:18,024 INFO L93 Difference]: Finished difference Result 395 states and 405 transitions. [2018-10-15 12:45:18,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 12:45:18,025 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 91 [2018-10-15 12:45:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:18,027 INFO L225 Difference]: With dead ends: 395 [2018-10-15 12:45:18,027 INFO L226 Difference]: Without dead ends: 389 [2018-10-15 12:45:18,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=599, Invalid=2157, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:45:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-15 12:45:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 176. [2018-10-15 12:45:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 12:45:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-10-15 12:45:18,031 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 91 [2018-10-15 12:45:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:18,031 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-10-15 12:45:18,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:45:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-10-15 12:45:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 12:45:18,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:18,032 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:18,032 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:18,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:18,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1625929407, now seen corresponding path program 32 times [2018-10-15 12:45:18,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:18,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:18,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:45:18,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:45:18,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:45:18,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:45:18,473 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 27 states. [2018-10-15 12:45:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:19,198 INFO L93 Difference]: Finished difference Result 368 states and 379 transitions. [2018-10-15 12:45:19,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:45:19,198 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 91 [2018-10-15 12:45:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:19,200 INFO L225 Difference]: With dead ends: 368 [2018-10-15 12:45:19,200 INFO L226 Difference]: Without dead ends: 362 [2018-10-15 12:45:19,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=786, Invalid=2754, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 12:45:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-15 12:45:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 182. [2018-10-15 12:45:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:45:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 12:45:19,205 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 91 [2018-10-15 12:45:19,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:19,205 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 12:45:19,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:45:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 12:45:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 12:45:19,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:19,206 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:19,206 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:19,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash 794759611, now seen corresponding path program 33 times [2018-10-15 12:45:19,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:20,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:20,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:45:20,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:45:20,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:45:20,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:45:20,592 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 23 states. [2018-10-15 12:45:21,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:21,038 INFO L93 Difference]: Finished difference Result 374 states and 385 transitions. [2018-10-15 12:45:21,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 12:45:21,039 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-10-15 12:45:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:21,041 INFO L225 Difference]: With dead ends: 374 [2018-10-15 12:45:21,041 INFO L226 Difference]: Without dead ends: 368 [2018-10-15 12:45:21,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=480, Invalid=1500, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:45:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-15 12:45:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 182. [2018-10-15 12:45:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:45:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 12:45:21,045 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 94 [2018-10-15 12:45:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:21,045 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 12:45:21,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:45:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 12:45:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 12:45:21,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:21,046 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:21,047 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:21,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:21,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1253555930, now seen corresponding path program 34 times [2018-10-15 12:45:21,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:21,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:21,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:45:21,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:45:21,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:45:21,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:45:21,438 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 25 states. [2018-10-15 12:45:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:21,913 INFO L93 Difference]: Finished difference Result 410 states and 421 transitions. [2018-10-15 12:45:21,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 12:45:21,914 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-10-15 12:45:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:21,917 INFO L225 Difference]: With dead ends: 410 [2018-10-15 12:45:21,917 INFO L226 Difference]: Without dead ends: 404 [2018-10-15 12:45:21,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=582, Invalid=2070, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:45:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-15 12:45:21,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 182. [2018-10-15 12:45:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:45:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 12:45:21,920 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 94 [2018-10-15 12:45:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:21,921 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 12:45:21,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:45:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 12:45:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 12:45:21,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:21,922 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:21,922 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:21,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:21,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1931134393, now seen corresponding path program 35 times [2018-10-15 12:45:21,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:22,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:22,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:45:22,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:45:22,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:45:22,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:45:22,940 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 27 states. [2018-10-15 12:45:23,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:23,559 INFO L93 Difference]: Finished difference Result 396 states and 407 transitions. [2018-10-15 12:45:23,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 12:45:23,559 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 94 [2018-10-15 12:45:23,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:23,562 INFO L225 Difference]: With dead ends: 396 [2018-10-15 12:45:23,562 INFO L226 Difference]: Without dead ends: 390 [2018-10-15 12:45:23,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=748, Invalid=2674, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:45:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-15 12:45:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 182. [2018-10-15 12:45:23,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:45:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 12:45:23,566 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 94 [2018-10-15 12:45:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:23,567 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 12:45:23,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:45:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 12:45:23,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-15 12:45:23,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:23,568 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:23,568 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:23,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:23,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1642657785, now seen corresponding path program 36 times [2018-10-15 12:45:23,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:23,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:23,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:45:23,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:45:23,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:45:23,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:45:23,812 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 23 states. [2018-10-15 12:45:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:24,272 INFO L93 Difference]: Finished difference Result 333 states and 344 transitions. [2018-10-15 12:45:24,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:45:24,273 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2018-10-15 12:45:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:24,274 INFO L225 Difference]: With dead ends: 333 [2018-10-15 12:45:24,274 INFO L226 Difference]: Without dead ends: 327 [2018-10-15 12:45:24,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=492, Invalid=1400, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:45:24,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-15 12:45:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 182. [2018-10-15 12:45:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:45:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 12:45:24,279 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 97 [2018-10-15 12:45:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:24,279 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 12:45:24,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:45:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 12:45:24,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-15 12:45:24,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:24,280 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:24,280 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:24,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:24,281 INFO L82 PathProgramCache]: Analyzing trace with hash -65688120, now seen corresponding path program 37 times [2018-10-15 12:45:24,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:24,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:24,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:45:24,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:45:24,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:45:24,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:45:24,570 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 25 states. [2018-10-15 12:45:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:25,059 INFO L93 Difference]: Finished difference Result 405 states and 416 transitions. [2018-10-15 12:45:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:45:25,059 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 97 [2018-10-15 12:45:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:25,062 INFO L225 Difference]: With dead ends: 405 [2018-10-15 12:45:25,062 INFO L226 Difference]: Without dead ends: 399 [2018-10-15 12:45:25,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=573, Invalid=1977, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:45:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-15 12:45:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 182. [2018-10-15 12:45:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:45:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 12:45:25,065 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 97 [2018-10-15 12:45:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:25,066 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 12:45:25,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:45:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 12:45:25,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-15 12:45:25,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:25,066 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:25,067 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:25,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:25,067 INFO L82 PathProgramCache]: Analyzing trace with hash 397603273, now seen corresponding path program 38 times [2018-10-15 12:45:25,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:25,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:25,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:45:25,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:45:25,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:45:25,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:45:25,411 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 27 states. [2018-10-15 12:45:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:26,095 INFO L93 Difference]: Finished difference Result 409 states and 420 transitions. [2018-10-15 12:45:26,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:45:26,095 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 97 [2018-10-15 12:45:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:26,098 INFO L225 Difference]: With dead ends: 409 [2018-10-15 12:45:26,098 INFO L226 Difference]: Without dead ends: 403 [2018-10-15 12:45:26,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=718, Invalid=2588, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 12:45:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-15 12:45:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 182. [2018-10-15 12:45:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:45:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 12:45:26,102 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 97 [2018-10-15 12:45:26,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:26,103 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 12:45:26,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:45:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 12:45:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-15 12:45:26,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:26,104 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:26,104 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:26,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:26,104 INFO L82 PathProgramCache]: Analyzing trace with hash 589685770, now seen corresponding path program 39 times [2018-10-15 12:45:26,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:26,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:26,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:45:26,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:45:26,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:45:26,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:45:26,483 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 29 states. [2018-10-15 12:45:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:27,473 INFO L93 Difference]: Finished difference Result 382 states and 394 transitions. [2018-10-15 12:45:27,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:45:27,474 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 97 [2018-10-15 12:45:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:27,476 INFO L225 Difference]: With dead ends: 382 [2018-10-15 12:45:27,476 INFO L226 Difference]: Without dead ends: 376 [2018-10-15 12:45:27,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=927, Invalid=3233, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:45:27,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-15 12:45:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 188. [2018-10-15 12:45:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-15 12:45:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2018-10-15 12:45:27,481 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 97 [2018-10-15 12:45:27,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:27,481 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-10-15 12:45:27,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:45:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2018-10-15 12:45:27,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:45:27,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:27,482 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:27,482 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:27,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:27,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2026858191, now seen corresponding path program 9 times [2018-10-15 12:45:27,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:27,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:27,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:45:27,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:45:27,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:45:27,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:45:27,872 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand 23 states. [2018-10-15 12:45:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:28,306 INFO L93 Difference]: Finished difference Result 283 states and 295 transitions. [2018-10-15 12:45:28,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 12:45:28,307 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 100 [2018-10-15 12:45:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:28,309 INFO L225 Difference]: With dead ends: 283 [2018-10-15 12:45:28,309 INFO L226 Difference]: Without dead ends: 277 [2018-10-15 12:45:28,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:45:28,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-15 12:45:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 200. [2018-10-15 12:45:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:45:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 12:45:28,313 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 100 [2018-10-15 12:45:28,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:28,314 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 12:45:28,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:45:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 12:45:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:45:28,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:28,315 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:28,315 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:28,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:28,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2009473904, now seen corresponding path program 40 times [2018-10-15 12:45:28,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:28,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:28,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:45:28,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:45:28,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:45:28,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:45:28,571 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 25 states. [2018-10-15 12:45:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:29,022 INFO L93 Difference]: Finished difference Result 451 states and 463 transitions. [2018-10-15 12:45:29,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:45:29,023 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-10-15 12:45:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:29,025 INFO L225 Difference]: With dead ends: 451 [2018-10-15 12:45:29,025 INFO L226 Difference]: Without dead ends: 445 [2018-10-15 12:45:29,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=1878, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:45:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-15 12:45:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 200. [2018-10-15 12:45:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:45:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 12:45:29,029 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 100 [2018-10-15 12:45:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:29,029 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 12:45:29,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:45:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 12:45:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:45:29,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:29,030 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:29,031 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:29,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:29,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1550677585, now seen corresponding path program 41 times [2018-10-15 12:45:29,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:30,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:30,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:45:30,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:45:30,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:45:30,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:45:30,295 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 27 states. [2018-10-15 12:45:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:30,907 INFO L93 Difference]: Finished difference Result 469 states and 481 transitions. [2018-10-15 12:45:30,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:45:30,908 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2018-10-15 12:45:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:30,910 INFO L225 Difference]: With dead ends: 469 [2018-10-15 12:45:30,910 INFO L226 Difference]: Without dead ends: 463 [2018-10-15 12:45:30,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=696, Invalid=2496, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:45:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-10-15 12:45:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 200. [2018-10-15 12:45:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:45:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 12:45:30,915 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 100 [2018-10-15 12:45:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:30,916 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 12:45:30,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:45:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 12:45:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:45:30,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:30,917 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:30,917 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:30,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash -873099122, now seen corresponding path program 42 times [2018-10-15 12:45:30,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:31,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:31,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:45:31,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:45:31,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:45:31,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:45:31,331 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 29 states. [2018-10-15 12:45:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:32,107 INFO L93 Difference]: Finished difference Result 446 states and 458 transitions. [2018-10-15 12:45:32,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 12:45:32,107 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 100 [2018-10-15 12:45:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:32,110 INFO L225 Difference]: With dead ends: 446 [2018-10-15 12:45:32,110 INFO L226 Difference]: Without dead ends: 440 [2018-10-15 12:45:32,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=884, Invalid=3148, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 12:45:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-15 12:45:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 200. [2018-10-15 12:45:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:45:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 12:45:32,113 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 100 [2018-10-15 12:45:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:32,114 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 12:45:32,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:45:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 12:45:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 12:45:32,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:32,114 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:32,115 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:32,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1154428654, now seen corresponding path program 43 times [2018-10-15 12:45:32,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:32,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:32,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:45:32,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:45:32,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:45:32,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:45:32,972 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 25 states. [2018-10-15 12:45:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:33,492 INFO L93 Difference]: Finished difference Result 419 states and 431 transitions. [2018-10-15 12:45:33,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 12:45:33,492 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 103 [2018-10-15 12:45:33,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:33,496 INFO L225 Difference]: With dead ends: 419 [2018-10-15 12:45:33,496 INFO L226 Difference]: Without dead ends: 413 [2018-10-15 12:45:33,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=579, Invalid=1773, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:45:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-10-15 12:45:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 200. [2018-10-15 12:45:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:45:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 12:45:33,500 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 103 [2018-10-15 12:45:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:33,500 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 12:45:33,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:45:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 12:45:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 12:45:33,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:33,501 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:33,501 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:33,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:33,502 INFO L82 PathProgramCache]: Analyzing trace with hash 422541011, now seen corresponding path program 44 times [2018-10-15 12:45:33,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:33,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:33,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:45:33,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:45:33,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:45:33,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:45:33,806 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 27 states. [2018-10-15 12:45:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:34,457 INFO L93 Difference]: Finished difference Result 473 states and 485 transitions. [2018-10-15 12:45:34,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 12:45:34,458 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 103 [2018-10-15 12:45:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:34,460 INFO L225 Difference]: With dead ends: 473 [2018-10-15 12:45:34,460 INFO L226 Difference]: Without dead ends: 467 [2018-10-15 12:45:34,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=682, Invalid=2398, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 12:45:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-15 12:45:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 200. [2018-10-15 12:45:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:45:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 12:45:34,463 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 103 [2018-10-15 12:45:34,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:34,463 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 12:45:34,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:45:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 12:45:34,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 12:45:34,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:34,464 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:34,464 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:34,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:34,464 INFO L82 PathProgramCache]: Analyzing trace with hash 885832404, now seen corresponding path program 45 times [2018-10-15 12:45:34,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:35,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:35,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:45:35,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:45:35,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:45:35,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:45:35,048 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 29 states. [2018-10-15 12:45:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:35,700 INFO L93 Difference]: Finished difference Result 468 states and 480 transitions. [2018-10-15 12:45:35,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 12:45:35,700 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 103 [2018-10-15 12:45:35,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:35,702 INFO L225 Difference]: With dead ends: 468 [2018-10-15 12:45:35,703 INFO L226 Difference]: Without dead ends: 462 [2018-10-15 12:45:35,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=849, Invalid=3057, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:45:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-10-15 12:45:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 200. [2018-10-15 12:45:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:45:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 12:45:35,706 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 103 [2018-10-15 12:45:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:35,706 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 12:45:35,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:45:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 12:45:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 12:45:35,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:35,707 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:35,707 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:35,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:35,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1077914901, now seen corresponding path program 46 times [2018-10-15 12:45:35,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:36,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:36,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:45:36,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:45:36,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:45:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:45:36,410 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 31 states. [2018-10-15 12:45:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:37,311 INFO L93 Difference]: Finished difference Result 423 states and 436 transitions. [2018-10-15 12:45:37,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 12:45:37,311 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 103 [2018-10-15 12:45:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:37,313 INFO L225 Difference]: With dead ends: 423 [2018-10-15 12:45:37,314 INFO L226 Difference]: Without dead ends: 417 [2018-10-15 12:45:37,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1080, Invalid=3750, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 12:45:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-15 12:45:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 206. [2018-10-15 12:45:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 12:45:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-10-15 12:45:37,317 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 103 [2018-10-15 12:45:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:37,318 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-10-15 12:45:37,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:45:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-10-15 12:45:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 12:45:37,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:37,318 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:37,319 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:37,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:37,319 INFO L82 PathProgramCache]: Analyzing trace with hash 47919174, now seen corresponding path program 47 times [2018-10-15 12:45:37,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:37,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:37,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:45:37,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:45:37,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:45:37,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:45:37,698 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 25 states. [2018-10-15 12:45:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:38,372 INFO L93 Difference]: Finished difference Result 375 states and 388 transitions. [2018-10-15 12:45:38,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:45:38,372 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2018-10-15 12:45:38,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:38,374 INFO L225 Difference]: With dead ends: 375 [2018-10-15 12:45:38,374 INFO L226 Difference]: Without dead ends: 369 [2018-10-15 12:45:38,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=594, Invalid=1662, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:45:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-15 12:45:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 206. [2018-10-15 12:45:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 12:45:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-10-15 12:45:38,378 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 106 [2018-10-15 12:45:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:38,378 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-10-15 12:45:38,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:45:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-10-15 12:45:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 12:45:38,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:38,379 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:38,379 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:38,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash 65303461, now seen corresponding path program 48 times [2018-10-15 12:45:38,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:39,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:39,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:45:39,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:45:39,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:45:39,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:45:39,228 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 27 states. [2018-10-15 12:45:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:39,800 INFO L93 Difference]: Finished difference Result 465 states and 478 transitions. [2018-10-15 12:45:39,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:45:39,801 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 106 [2018-10-15 12:45:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:39,803 INFO L225 Difference]: With dead ends: 465 [2018-10-15 12:45:39,803 INFO L226 Difference]: Without dead ends: 459 [2018-10-15 12:45:39,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=676, Invalid=2294, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:45:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-15 12:45:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 206. [2018-10-15 12:45:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 12:45:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-10-15 12:45:39,807 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 106 [2018-10-15 12:45:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:39,807 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-10-15 12:45:39,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:45:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-10-15 12:45:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 12:45:39,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:39,808 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:39,808 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:39,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:39,808 INFO L82 PathProgramCache]: Analyzing trace with hash 524099780, now seen corresponding path program 49 times [2018-10-15 12:45:39,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:40,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:40,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:45:40,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:45:40,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:45:40,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:45:40,090 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 29 states. [2018-10-15 12:45:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:40,774 INFO L93 Difference]: Finished difference Result 483 states and 496 transitions. [2018-10-15 12:45:40,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:45:40,775 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 106 [2018-10-15 12:45:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:40,777 INFO L225 Difference]: With dead ends: 483 [2018-10-15 12:45:40,777 INFO L226 Difference]: Without dead ends: 477 [2018-10-15 12:45:40,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=822, Invalid=2960, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 12:45:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-15 12:45:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 206. [2018-10-15 12:45:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 12:45:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-10-15 12:45:40,781 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 106 [2018-10-15 12:45:40,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:40,781 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-10-15 12:45:40,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:45:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-10-15 12:45:40,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 12:45:40,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:40,782 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:40,783 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:40,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:40,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1201678243, now seen corresponding path program 50 times [2018-10-15 12:45:40,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:41,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:41,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:45:41,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:45:41,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:45:41,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:45:41,087 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 31 states. [2018-10-15 12:45:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:41,911 INFO L93 Difference]: Finished difference Result 460 states and 473 transitions. [2018-10-15 12:45:41,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:45:41,912 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 106 [2018-10-15 12:45:41,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:41,914 INFO L225 Difference]: With dead ends: 460 [2018-10-15 12:45:41,914 INFO L226 Difference]: Without dead ends: 454 [2018-10-15 12:45:41,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1032, Invalid=3660, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:45:41,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-10-15 12:45:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 206. [2018-10-15 12:45:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 12:45:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-10-15 12:45:41,918 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 106 [2018-10-15 12:45:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:41,919 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-10-15 12:45:41,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:45:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-10-15 12:45:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:45:41,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:41,920 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:41,920 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:41,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash -218018212, now seen corresponding path program 10 times [2018-10-15 12:45:41,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:42,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:42,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:45:42,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:45:42,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:45:42,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:45:42,140 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 25 states. [2018-10-15 12:45:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:42,669 INFO L93 Difference]: Finished difference Result 310 states and 323 transitions. [2018-10-15 12:45:42,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 12:45:42,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 109 [2018-10-15 12:45:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:42,671 INFO L225 Difference]: With dead ends: 310 [2018-10-15 12:45:42,672 INFO L226 Difference]: Without dead ends: 304 [2018-10-15 12:45:42,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=617, Invalid=1545, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:45:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-15 12:45:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 218. [2018-10-15 12:45:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 12:45:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 231 transitions. [2018-10-15 12:45:42,674 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 231 transitions. Word has length 109 [2018-10-15 12:45:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:42,675 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 231 transitions. [2018-10-15 12:45:42,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:45:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 231 transitions. [2018-10-15 12:45:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:45:42,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:42,676 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:42,676 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:42,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash -336304675, now seen corresponding path program 51 times [2018-10-15 12:45:42,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:43,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:43,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:45:43,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:45:43,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:45:43,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:45:43,197 INFO L87 Difference]: Start difference. First operand 218 states and 231 transitions. Second operand 27 states. [2018-10-15 12:45:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:43,731 INFO L93 Difference]: Finished difference Result 505 states and 518 transitions. [2018-10-15 12:45:43,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 12:45:43,732 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 109 [2018-10-15 12:45:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:43,734 INFO L225 Difference]: With dead ends: 505 [2018-10-15 12:45:43,734 INFO L226 Difference]: Without dead ends: 499 [2018-10-15 12:45:43,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=678, Invalid=2184, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 12:45:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-10-15 12:45:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 218. [2018-10-15 12:45:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 12:45:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 231 transitions. [2018-10-15 12:45:43,738 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 231 transitions. Word has length 109 [2018-10-15 12:45:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:43,738 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 231 transitions. [2018-10-15 12:45:43,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:45:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 231 transitions. [2018-10-15 12:45:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:45:43,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:43,739 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:43,739 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:43,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:43,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1240664990, now seen corresponding path program 52 times [2018-10-15 12:45:43,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:44,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:44,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:45:44,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:45:44,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:45:44,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:45:44,011 INFO L87 Difference]: Start difference. First operand 218 states and 231 transitions. Second operand 29 states. [2018-10-15 12:45:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:44,704 INFO L93 Difference]: Finished difference Result 541 states and 554 transitions. [2018-10-15 12:45:44,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:45:44,705 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-10-15 12:45:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:44,707 INFO L225 Difference]: With dead ends: 541 [2018-10-15 12:45:44,708 INFO L226 Difference]: Without dead ends: 535 [2018-10-15 12:45:44,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=803, Invalid=2857, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:45:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-15 12:45:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 218. [2018-10-15 12:45:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 12:45:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 231 transitions. [2018-10-15 12:45:44,712 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 231 transitions. Word has length 109 [2018-10-15 12:45:44,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:44,712 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 231 transitions. [2018-10-15 12:45:44,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:45:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 231 transitions. [2018-10-15 12:45:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:45:44,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:44,713 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:44,713 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:44,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:44,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1703956383, now seen corresponding path program 53 times [2018-10-15 12:45:44,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:45,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:45,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:45:45,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:45:45,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:45:45,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:45:45,001 INFO L87 Difference]: Start difference. First operand 218 states and 231 transitions. Second operand 31 states. [2018-10-15 12:45:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:45,749 INFO L93 Difference]: Finished difference Result 527 states and 540 transitions. [2018-10-15 12:45:45,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 12:45:45,749 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 109 [2018-10-15 12:45:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:45,752 INFO L225 Difference]: With dead ends: 527 [2018-10-15 12:45:45,752 INFO L226 Difference]: Without dead ends: 521 [2018-10-15 12:45:45,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=992, Invalid=3564, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:45:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-10-15 12:45:45,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 218. [2018-10-15 12:45:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 12:45:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 231 transitions. [2018-10-15 12:45:45,756 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 231 transitions. Word has length 109 [2018-10-15 12:45:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:45,756 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 231 transitions. [2018-10-15 12:45:45,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:45:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 231 transitions. [2018-10-15 12:45:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:45:45,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:45,757 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:45,757 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:45,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:45,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1896038880, now seen corresponding path program 54 times [2018-10-15 12:45:45,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 433 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:46,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:46,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:45:46,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:45:46,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:45:46,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:45:46,193 INFO L87 Difference]: Start difference. First operand 218 states and 231 transitions. Second operand 33 states. [2018-10-15 12:45:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:47,126 INFO L93 Difference]: Finished difference Result 464 states and 478 transitions. [2018-10-15 12:45:47,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 12:45:47,127 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 109 [2018-10-15 12:45:47,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:47,129 INFO L225 Difference]: With dead ends: 464 [2018-10-15 12:45:47,129 INFO L226 Difference]: Without dead ends: 458 [2018-10-15 12:45:47,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1245, Invalid=4305, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:45:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-15 12:45:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 224. [2018-10-15 12:45:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:45:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 12:45:47,133 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 109 [2018-10-15 12:45:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:47,133 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 12:45:47,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:45:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 12:45:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 12:45:47,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:47,134 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:47,134 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:47,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:47,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1160027237, now seen corresponding path program 55 times [2018-10-15 12:45:47,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:47,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:47,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:45:47,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:45:47,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:45:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:45:47,459 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 27 states. [2018-10-15 12:45:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:48,231 INFO L93 Difference]: Finished difference Result 470 states and 484 transitions. [2018-10-15 12:45:48,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 12:45:48,231 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 112 [2018-10-15 12:45:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:48,232 INFO L225 Difference]: With dead ends: 470 [2018-10-15 12:45:48,232 INFO L226 Difference]: Without dead ends: 464 [2018-10-15 12:45:48,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=688, Invalid=2068, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:45:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-15 12:45:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 224. [2018-10-15 12:45:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:45:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 12:45:48,236 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 112 [2018-10-15 12:45:48,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:48,236 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 12:45:48,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:45:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 12:45:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 12:45:48,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:48,237 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:48,237 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:48,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:48,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1142642950, now seen corresponding path program 56 times [2018-10-15 12:45:48,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:48,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:48,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:45:48,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:45:48,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:45:48,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:45:48,728 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 29 states. [2018-10-15 12:45:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:49,381 INFO L93 Difference]: Finished difference Result 542 states and 556 transitions. [2018-10-15 12:45:49,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 12:45:49,382 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 112 [2018-10-15 12:45:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:49,385 INFO L225 Difference]: With dead ends: 542 [2018-10-15 12:45:49,385 INFO L226 Difference]: Without dead ends: 536 [2018-10-15 12:45:49,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=792, Invalid=2748, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 12:45:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-15 12:45:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 224. [2018-10-15 12:45:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:45:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 12:45:49,389 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 112 [2018-10-15 12:45:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:49,390 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 12:45:49,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:45:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 12:45:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 12:45:49,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:49,391 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:49,391 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:49,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:49,391 INFO L82 PathProgramCache]: Analyzing trace with hash -683846631, now seen corresponding path program 57 times [2018-10-15 12:45:49,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:49,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:49,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:45:49,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:45:49,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:45:49,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:45:49,731 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 31 states. [2018-10-15 12:45:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:50,504 INFO L93 Difference]: Finished difference Result 546 states and 560 transitions. [2018-10-15 12:45:50,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:45:50,505 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 112 [2018-10-15 12:45:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:50,507 INFO L225 Difference]: With dead ends: 546 [2018-10-15 12:45:50,508 INFO L226 Difference]: Without dead ends: 540 [2018-10-15 12:45:50,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=960, Invalid=3462, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:45:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-15 12:45:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 224. [2018-10-15 12:45:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:45:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 12:45:50,511 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 112 [2018-10-15 12:45:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:50,511 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 12:45:50,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:45:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 12:45:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 12:45:50,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:50,512 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:50,512 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:50,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:50,513 INFO L82 PathProgramCache]: Analyzing trace with hash -6268168, now seen corresponding path program 58 times [2018-10-15 12:45:50,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:50,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:50,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:45:50,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:45:50,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:45:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:45:50,982 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 33 states. [2018-10-15 12:45:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:51,915 INFO L93 Difference]: Finished difference Result 510 states and 524 transitions. [2018-10-15 12:45:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 12:45:51,915 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 112 [2018-10-15 12:45:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:51,918 INFO L225 Difference]: With dead ends: 510 [2018-10-15 12:45:51,918 INFO L226 Difference]: Without dead ends: 504 [2018-10-15 12:45:51,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1192, Invalid=4210, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 12:45:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-10-15 12:45:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 224. [2018-10-15 12:45:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:45:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 12:45:51,922 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 112 [2018-10-15 12:45:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:51,922 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 12:45:51,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:45:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 12:45:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 12:45:51,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:51,923 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:51,924 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:51,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1381424871, now seen corresponding path program 59 times [2018-10-15 12:45:51,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:52,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:52,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:45:52,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:45:52,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:45:52,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:45:52,158 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 27 states. [2018-10-15 12:45:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:52,682 INFO L93 Difference]: Finished difference Result 411 states and 425 transitions. [2018-10-15 12:45:52,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:45:52,682 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 115 [2018-10-15 12:45:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:52,684 INFO L225 Difference]: With dead ends: 411 [2018-10-15 12:45:52,684 INFO L226 Difference]: Without dead ends: 405 [2018-10-15 12:45:52,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=706, Invalid=1946, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:45:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-15 12:45:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 224. [2018-10-15 12:45:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:45:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 12:45:52,689 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 115 [2018-10-15 12:45:52,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:52,689 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 12:45:52,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:45:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 12:45:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 12:45:52,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:52,690 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:52,690 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:52,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:52,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1263138408, now seen corresponding path program 60 times [2018-10-15 12:45:52,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:52,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:52,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:45:52,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:45:52,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:45:52,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:45:52,969 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 29 states. [2018-10-15 12:45:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:53,913 INFO L93 Difference]: Finished difference Result 519 states and 533 transitions. [2018-10-15 12:45:53,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:45:53,913 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-10-15 12:45:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:53,916 INFO L225 Difference]: With dead ends: 519 [2018-10-15 12:45:53,916 INFO L226 Difference]: Without dead ends: 513 [2018-10-15 12:45:53,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=789, Invalid=2633, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:45:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-15 12:45:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 224. [2018-10-15 12:45:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:45:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 12:45:53,920 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 115 [2018-10-15 12:45:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:53,920 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 12:45:53,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:45:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 12:45:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 12:45:53,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:53,921 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:53,921 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:53,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:53,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1454859223, now seen corresponding path program 61 times [2018-10-15 12:45:53,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:54,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:54,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:45:54,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:45:54,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:45:54,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:45:54,282 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 31 states. [2018-10-15 12:45:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:55,041 INFO L93 Difference]: Finished difference Result 555 states and 569 transitions. [2018-10-15 12:45:55,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:45:55,041 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 115 [2018-10-15 12:45:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:55,044 INFO L225 Difference]: With dead ends: 555 [2018-10-15 12:45:55,044 INFO L226 Difference]: Without dead ends: 549 [2018-10-15 12:45:55,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=936, Invalid=3354, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 12:45:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-10-15 12:45:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 224. [2018-10-15 12:45:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:45:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 12:45:55,048 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 115 [2018-10-15 12:45:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:55,048 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 12:45:55,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:45:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 12:45:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 12:45:55,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:55,049 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:55,049 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:55,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:55,049 INFO L82 PathProgramCache]: Analyzing trace with hash -991567830, now seen corresponding path program 62 times [2018-10-15 12:45:55,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:55,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:55,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:45:55,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:45:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:45:55,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:45:55,429 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 33 states. [2018-10-15 12:45:56,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:56,272 INFO L93 Difference]: Finished difference Result 541 states and 555 transitions. [2018-10-15 12:45:56,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:45:56,273 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 115 [2018-10-15 12:45:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:56,276 INFO L225 Difference]: With dead ends: 541 [2018-10-15 12:45:56,276 INFO L226 Difference]: Without dead ends: 535 [2018-10-15 12:45:56,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1147, Invalid=4109, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:45:56,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-15 12:45:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 224. [2018-10-15 12:45:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:45:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 12:45:56,280 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 115 [2018-10-15 12:45:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:56,280 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 12:45:56,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:45:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 12:45:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 12:45:56,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:56,281 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:56,281 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:56,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash -799485333, now seen corresponding path program 63 times [2018-10-15 12:45:56,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:56,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:56,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:45:56,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:45:56,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:45:56,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=924, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:45:56,610 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 35 states. [2018-10-15 12:45:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:57,839 INFO L93 Difference]: Finished difference Result 478 states and 493 transitions. [2018-10-15 12:45:57,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:45:57,840 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 115 [2018-10-15 12:45:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:57,842 INFO L225 Difference]: With dead ends: 478 [2018-10-15 12:45:57,842 INFO L226 Difference]: Without dead ends: 472 [2018-10-15 12:45:57,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1422, Invalid=4898, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 12:45:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-15 12:45:57,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 230. [2018-10-15 12:45:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 12:45:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 245 transitions. [2018-10-15 12:45:57,846 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 245 transitions. Word has length 115 [2018-10-15 12:45:57,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:57,846 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 245 transitions. [2018-10-15 12:45:57,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:45:57,846 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 245 transitions. [2018-10-15 12:45:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:45:57,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:57,847 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:57,847 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:57,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash -964544111, now seen corresponding path program 11 times [2018-10-15 12:45:57,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 0 proven. 517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:58,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:58,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:45:58,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:45:58,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:45:58,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:45:58,060 INFO L87 Difference]: Start difference. First operand 230 states and 245 transitions. Second operand 27 states. [2018-10-15 12:45:58,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:58,846 INFO L93 Difference]: Finished difference Result 343 states and 358 transitions. [2018-10-15 12:45:58,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:45:58,847 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 118 [2018-10-15 12:45:58,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:58,848 INFO L225 Difference]: With dead ends: 343 [2018-10-15 12:45:58,849 INFO L226 Difference]: Without dead ends: 337 [2018-10-15 12:45:58,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=732, Invalid=1818, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:45:58,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-15 12:45:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 242. [2018-10-15 12:45:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 12:45:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 12:45:58,852 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 118 [2018-10-15 12:45:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:58,852 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 12:45:58,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:45:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 12:45:58,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:45:58,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:58,853 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:58,853 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:58,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:58,854 INFO L82 PathProgramCache]: Analyzing trace with hash -518323408, now seen corresponding path program 64 times [2018-10-15 12:45:58,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:59,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:59,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:45:59,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:45:59,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:45:59,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:45:59,149 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 29 states. [2018-10-15 12:45:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:59,794 INFO L93 Difference]: Finished difference Result 565 states and 580 transitions. [2018-10-15 12:45:59,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:45:59,794 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2018-10-15 12:45:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:59,797 INFO L225 Difference]: With dead ends: 565 [2018-10-15 12:45:59,797 INFO L226 Difference]: Without dead ends: 559 [2018-10-15 12:45:59,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=794, Invalid=2512, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 12:45:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-15 12:45:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 242. [2018-10-15 12:45:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 12:45:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 12:45:59,801 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 118 [2018-10-15 12:45:59,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:59,801 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 12:45:59,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:45:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 12:45:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:45:59,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:59,802 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:59,802 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:59,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:59,803 INFO L82 PathProgramCache]: Analyzing trace with hash -500939121, now seen corresponding path program 65 times [2018-10-15 12:45:59,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:00,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:00,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:46:00,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:46:00,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:46:00,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:46:00,174 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 31 states. [2018-10-15 12:46:00,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:00,893 INFO L93 Difference]: Finished difference Result 619 states and 634 transitions. [2018-10-15 12:46:00,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 12:46:00,893 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 118 [2018-10-15 12:46:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:00,896 INFO L225 Difference]: With dead ends: 619 [2018-10-15 12:46:00,896 INFO L226 Difference]: Without dead ends: 613 [2018-10-15 12:46:00,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=920, Invalid=3240, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:46:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-10-15 12:46:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 242. [2018-10-15 12:46:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 12:46:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 12:46:00,900 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 118 [2018-10-15 12:46:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:00,901 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 12:46:00,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:46:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 12:46:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:46:00,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:00,902 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:00,902 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:00,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:00,902 INFO L82 PathProgramCache]: Analyzing trace with hash -42142802, now seen corresponding path program 66 times [2018-10-15 12:46:00,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:01,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:01,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:46:01,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:46:01,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:46:01,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:46:01,302 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 33 states. [2018-10-15 12:46:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:02,126 INFO L93 Difference]: Finished difference Result 614 states and 629 transitions. [2018-10-15 12:46:02,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 12:46:02,127 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 118 [2018-10-15 12:46:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:02,129 INFO L225 Difference]: With dead ends: 614 [2018-10-15 12:46:02,129 INFO L226 Difference]: Without dead ends: 608 [2018-10-15 12:46:02,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1110, Invalid=4002, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 12:46:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-15 12:46:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 242. [2018-10-15 12:46:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 12:46:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 12:46:02,134 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 118 [2018-10-15 12:46:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:02,134 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 12:46:02,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:46:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 12:46:02,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:46:02,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:02,135 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:02,135 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:02,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:02,135 INFO L82 PathProgramCache]: Analyzing trace with hash 635435661, now seen corresponding path program 67 times [2018-10-15 12:46:02,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:02,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:02,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:46:02,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:46:02,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:46:02,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=934, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:46:02,527 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 35 states. [2018-10-15 12:46:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:03,778 INFO L93 Difference]: Finished difference Result 560 states and 575 transitions. [2018-10-15 12:46:03,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 12:46:03,779 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 118 [2018-10-15 12:46:03,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:03,782 INFO L225 Difference]: With dead ends: 560 [2018-10-15 12:46:03,782 INFO L226 Difference]: Without dead ends: 554 [2018-10-15 12:46:03,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1364, Invalid=4798, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:46:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-15 12:46:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 242. [2018-10-15 12:46:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 12:46:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 12:46:03,786 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 118 [2018-10-15 12:46:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:03,786 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 12:46:03,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:46:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 12:46:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 12:46:03,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:03,787 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:03,787 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:03,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:03,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1480760114, now seen corresponding path program 68 times [2018-10-15 12:46:03,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:04,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:04,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:46:04,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:46:04,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:46:04,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:46:04,032 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 29 states. [2018-10-15 12:46:04,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:04,676 INFO L93 Difference]: Finished difference Result 515 states and 530 transitions. [2018-10-15 12:46:04,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 12:46:04,676 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 121 [2018-10-15 12:46:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:04,679 INFO L225 Difference]: With dead ends: 515 [2018-10-15 12:46:04,679 INFO L226 Difference]: Without dead ends: 509 [2018-10-15 12:46:04,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=807, Invalid=2385, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:46:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-10-15 12:46:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 242. [2018-10-15 12:46:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 12:46:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 12:46:04,683 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 121 [2018-10-15 12:46:04,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:04,683 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 12:46:04,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:46:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 12:46:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 12:46:04,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:04,684 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:04,684 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:04,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1362473651, now seen corresponding path program 69 times [2018-10-15 12:46:04,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:05,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:05,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:46:05,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:46:05,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:46:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:46:05,027 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 31 states. [2018-10-15 12:46:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:05,728 INFO L93 Difference]: Finished difference Result 605 states and 620 transitions. [2018-10-15 12:46:05,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 12:46:05,728 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 121 [2018-10-15 12:46:05,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:05,731 INFO L225 Difference]: With dead ends: 605 [2018-10-15 12:46:05,731 INFO L226 Difference]: Without dead ends: 599 [2018-10-15 12:46:05,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=912, Invalid=3120, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 12:46:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-15 12:46:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 242. [2018-10-15 12:46:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 12:46:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 12:46:05,735 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 121 [2018-10-15 12:46:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:05,735 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 12:46:05,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:46:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 12:46:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 12:46:05,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:05,736 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:05,736 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:05,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:05,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1355523980, now seen corresponding path program 70 times [2018-10-15 12:46:05,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 331 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:06,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:06,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:46:06,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:46:06,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:46:06,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:46:06,058 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 33 states. [2018-10-15 12:46:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:06,882 INFO L93 Difference]: Finished difference Result 623 states and 638 transitions. [2018-10-15 12:46:06,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 12:46:06,882 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 121 [2018-10-15 12:46:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:06,884 INFO L225 Difference]: With dead ends: 623 [2018-10-15 12:46:06,884 INFO L226 Difference]: Without dead ends: 617 [2018-10-15 12:46:06,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=3889, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:46:06,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-15 12:46:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 242. [2018-10-15 12:46:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 12:46:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 12:46:06,888 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 121 [2018-10-15 12:46:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:06,888 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 12:46:06,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:46:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 12:46:06,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 12:46:06,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:06,889 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:06,889 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:06,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:06,889 INFO L82 PathProgramCache]: Analyzing trace with hash -892232587, now seen corresponding path program 71 times [2018-10-15 12:46:06,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 414 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:07,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:07,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:46:07,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:46:07,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:46:07,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:46:07,376 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 35 states. [2018-10-15 12:46:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:08,361 INFO L93 Difference]: Finished difference Result 600 states and 615 transitions. [2018-10-15 12:46:08,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 12:46:08,361 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 121 [2018-10-15 12:46:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:08,364 INFO L225 Difference]: With dead ends: 600 [2018-10-15 12:46:08,364 INFO L226 Difference]: Without dead ends: 594 [2018-10-15 12:46:08,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1314, Invalid=4692, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 12:46:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-10-15 12:46:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 242. [2018-10-15 12:46:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 12:46:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 12:46:08,368 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 121 [2018-10-15 12:46:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:08,368 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 12:46:08,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:46:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 12:46:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 12:46:08,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:08,369 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:08,369 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:08,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash -700150090, now seen corresponding path program 72 times [2018-10-15 12:46:08,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 587 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:08,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:08,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:46:08,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:46:08,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:46:09,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1033, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:46:09,000 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 37 states. [2018-10-15 12:46:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:10,194 INFO L93 Difference]: Finished difference Result 519 states and 535 transitions. [2018-10-15 12:46:10,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 12:46:10,195 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 121 [2018-10-15 12:46:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:10,197 INFO L225 Difference]: With dead ends: 519 [2018-10-15 12:46:10,198 INFO L226 Difference]: Without dead ends: 513 [2018-10-15 12:46:10,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1611, Invalid=5529, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:46:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-15 12:46:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 248. [2018-10-15 12:46:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 12:46:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-10-15 12:46:10,202 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 121 [2018-10-15 12:46:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:10,203 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-10-15 12:46:10,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:46:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-10-15 12:46:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 12:46:10,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:10,204 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:10,204 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:10,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:10,204 INFO L82 PathProgramCache]: Analyzing trace with hash -900786842, now seen corresponding path program 73 times [2018-10-15 12:46:10,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 519 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:10,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:10,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:46:10,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:46:10,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:46:10,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:46:10,483 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 29 states. [2018-10-15 12:46:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:11,137 INFO L93 Difference]: Finished difference Result 453 states and 469 transitions. [2018-10-15 12:46:11,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:46:11,137 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 124 [2018-10-15 12:46:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:11,140 INFO L225 Difference]: With dead ends: 453 [2018-10-15 12:46:11,140 INFO L226 Difference]: Without dead ends: 447 [2018-10-15 12:46:11,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=828, Invalid=2252, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 12:46:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-15 12:46:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 248. [2018-10-15 12:46:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 12:46:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-10-15 12:46:11,144 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 124 [2018-10-15 12:46:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:11,145 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-10-15 12:46:11,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:46:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-10-15 12:46:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 12:46:11,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:11,146 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:11,146 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:11,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:11,146 INFO L82 PathProgramCache]: Analyzing trace with hash -454566139, now seen corresponding path program 74 times [2018-10-15 12:46:11,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 386 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:11,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:11,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:46:11,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:46:11,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:46:11,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:46:11,527 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 31 states. [2018-10-15 12:46:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:12,208 INFO L93 Difference]: Finished difference Result 579 states and 595 transitions. [2018-10-15 12:46:12,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:46:12,208 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 124 [2018-10-15 12:46:12,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:12,212 INFO L225 Difference]: With dead ends: 579 [2018-10-15 12:46:12,212 INFO L226 Difference]: Without dead ends: 573 [2018-10-15 12:46:12,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=912, Invalid=2994, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:46:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-10-15 12:46:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 248. [2018-10-15 12:46:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 12:46:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-10-15 12:46:12,216 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 124 [2018-10-15 12:46:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:12,217 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-10-15 12:46:12,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:46:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-10-15 12:46:12,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 12:46:12,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:12,218 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:12,218 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:12,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:12,218 INFO L82 PathProgramCache]: Analyzing trace with hash -437181852, now seen corresponding path program 75 times [2018-10-15 12:46:12,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:12,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:12,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:46:12,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:46:12,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:46:12,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:46:12,525 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 33 states. [2018-10-15 12:46:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:13,333 INFO L93 Difference]: Finished difference Result 633 states and 649 transitions. [2018-10-15 12:46:13,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:46:13,333 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2018-10-15 12:46:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:13,336 INFO L225 Difference]: With dead ends: 633 [2018-10-15 12:46:13,336 INFO L226 Difference]: Without dead ends: 627 [2018-10-15 12:46:13,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1060, Invalid=3770, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 12:46:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-10-15 12:46:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 248. [2018-10-15 12:46:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 12:46:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-10-15 12:46:13,341 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 124 [2018-10-15 12:46:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:13,341 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-10-15 12:46:13,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:46:13,342 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-10-15 12:46:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 12:46:13,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:13,343 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:13,343 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:13,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:13,343 INFO L82 PathProgramCache]: Analyzing trace with hash 21614467, now seen corresponding path program 76 times [2018-10-15 12:46:13,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:14,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:14,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:46:14,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:46:14,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:46:14,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:46:14,007 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 35 states. [2018-10-15 12:46:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:14,936 INFO L93 Difference]: Finished difference Result 628 states and 644 transitions. [2018-10-15 12:46:14,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:46:14,937 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 124 [2018-10-15 12:46:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:14,939 INFO L225 Difference]: With dead ends: 628 [2018-10-15 12:46:14,939 INFO L226 Difference]: Without dead ends: 622 [2018-10-15 12:46:14,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1272, Invalid=4580, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:46:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-10-15 12:46:14,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 248. [2018-10-15 12:46:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 12:46:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-10-15 12:46:14,943 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 124 [2018-10-15 12:46:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:14,943 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-10-15 12:46:14,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:46:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-10-15 12:46:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 12:46:14,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:14,944 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:14,944 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:14,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash 699192930, now seen corresponding path program 77 times [2018-10-15 12:46:14,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 527 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:15,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:15,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:46:15,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:46:15,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:46:15,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:46:15,369 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 37 states. [2018-10-15 12:46:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:16,503 INFO L93 Difference]: Finished difference Result 574 states and 590 transitions. [2018-10-15 12:46:16,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:46:16,504 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 124 [2018-10-15 12:46:16,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:16,505 INFO L225 Difference]: With dead ends: 574 [2018-10-15 12:46:16,505 INFO L226 Difference]: Without dead ends: 568 [2018-10-15 12:46:16,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1548, Invalid=5424, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 12:46:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-15 12:46:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 248. [2018-10-15 12:46:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 12:46:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-10-15 12:46:16,511 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 124 [2018-10-15 12:46:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:16,511 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-10-15 12:46:16,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:46:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-10-15 12:46:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 12:46:16,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:16,512 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:16,512 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:16,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:16,512 INFO L82 PathProgramCache]: Analyzing trace with hash -519169540, now seen corresponding path program 12 times [2018-10-15 12:46:16,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:16,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:16,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:46:16,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:46:16,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:46:16,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:46:16,788 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 29 states. [2018-10-15 12:46:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:17,456 INFO L93 Difference]: Finished difference Result 370 states and 386 transitions. [2018-10-15 12:46:17,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 12:46:17,456 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 127 [2018-10-15 12:46:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:17,457 INFO L225 Difference]: With dead ends: 370 [2018-10-15 12:46:17,457 INFO L226 Difference]: Without dead ends: 364 [2018-10-15 12:46:17,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=857, Invalid=2113, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:46:17,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-15 12:46:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 260. [2018-10-15 12:46:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 12:46:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 276 transitions. [2018-10-15 12:46:17,461 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 276 transitions. Word has length 127 [2018-10-15 12:46:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:17,462 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 276 transitions. [2018-10-15 12:46:17,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:46:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 276 transitions. [2018-10-15 12:46:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 12:46:17,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:17,462 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:17,463 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:17,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1796951235, now seen corresponding path program 78 times [2018-10-15 12:46:17,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:17,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:17,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:46:17,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:46:17,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:46:17,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:46:17,765 INFO L87 Difference]: Start difference. First operand 260 states and 276 transitions. Second operand 31 states. [2018-10-15 12:46:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:18,476 INFO L93 Difference]: Finished difference Result 619 states and 635 transitions. [2018-10-15 12:46:18,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:46:18,477 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 127 [2018-10-15 12:46:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:18,478 INFO L225 Difference]: With dead ends: 619 [2018-10-15 12:46:18,478 INFO L226 Difference]: Without dead ends: 613 [2018-10-15 12:46:18,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=920, Invalid=2862, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 12:46:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-10-15 12:46:18,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 260. [2018-10-15 12:46:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 12:46:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 276 transitions. [2018-10-15 12:46:18,482 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 276 transitions. Word has length 127 [2018-10-15 12:46:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:18,483 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 276 transitions. [2018-10-15 12:46:18,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:46:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 276 transitions. [2018-10-15 12:46:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 12:46:18,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:18,484 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:18,484 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:18,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1915237698, now seen corresponding path program 79 times [2018-10-15 12:46:18,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:19,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:19,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:46:19,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:46:19,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:46:19,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:46:19,094 INFO L87 Difference]: Start difference. First operand 260 states and 276 transitions. Second operand 33 states. [2018-10-15 12:46:19,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:19,952 INFO L93 Difference]: Finished difference Result 691 states and 707 transitions. [2018-10-15 12:46:19,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 12:46:19,952 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 127 [2018-10-15 12:46:19,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:19,954 INFO L225 Difference]: With dead ends: 691 [2018-10-15 12:46:19,954 INFO L226 Difference]: Without dead ends: 685 [2018-10-15 12:46:19,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1047, Invalid=3645, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:46:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-10-15 12:46:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 260. [2018-10-15 12:46:19,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 12:46:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 276 transitions. [2018-10-15 12:46:19,959 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 276 transitions. Word has length 127 [2018-10-15 12:46:19,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:19,959 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 276 transitions. [2018-10-15 12:46:19,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:46:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 276 transitions. [2018-10-15 12:46:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 12:46:19,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:19,960 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:19,960 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:19,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:19,960 INFO L82 PathProgramCache]: Analyzing trace with hash -338268033, now seen corresponding path program 80 times [2018-10-15 12:46:19,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:20,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:20,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:46:20,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:46:20,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:46:20,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:46:20,320 INFO L87 Difference]: Start difference. First operand 260 states and 276 transitions. Second operand 35 states. [2018-10-15 12:46:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:21,624 INFO L93 Difference]: Finished difference Result 695 states and 711 transitions. [2018-10-15 12:46:21,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 12:46:21,625 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 127 [2018-10-15 12:46:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:21,626 INFO L225 Difference]: With dead ends: 695 [2018-10-15 12:46:21,626 INFO L226 Difference]: Without dead ends: 689 [2018-10-15 12:46:21,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1238, Invalid=4462, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 12:46:21,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-10-15 12:46:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 260. [2018-10-15 12:46:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 12:46:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 276 transitions. [2018-10-15 12:46:21,631 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 276 transitions. Word has length 127 [2018-10-15 12:46:21,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:21,631 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 276 transitions. [2018-10-15 12:46:21,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:46:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 276 transitions. [2018-10-15 12:46:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 12:46:21,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:21,632 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:21,632 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:21,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:21,633 INFO L82 PathProgramCache]: Analyzing trace with hash 125023360, now seen corresponding path program 81 times [2018-10-15 12:46:21,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:22,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:22,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:46:22,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:46:22,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:46:22,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1053, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:46:22,209 INFO L87 Difference]: Start difference. First operand 260 states and 276 transitions. Second operand 37 states. [2018-10-15 12:46:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:23,160 INFO L93 Difference]: Finished difference Result 659 states and 675 transitions. [2018-10-15 12:46:23,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 12:46:23,160 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 127 [2018-10-15 12:46:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:23,162 INFO L225 Difference]: With dead ends: 659 [2018-10-15 12:46:23,162 INFO L226 Difference]: Without dead ends: 653 [2018-10-15 12:46:23,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1493, Invalid=5313, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:46:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-10-15 12:46:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 260. [2018-10-15 12:46:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 12:46:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 276 transitions. [2018-10-15 12:46:23,166 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 276 transitions. Word has length 127 [2018-10-15 12:46:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:23,166 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 276 transitions. [2018-10-15 12:46:23,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:46:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 276 transitions. [2018-10-15 12:46:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 12:46:23,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:23,167 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:23,168 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:23,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:23,168 INFO L82 PathProgramCache]: Analyzing trace with hash 317105857, now seen corresponding path program 82 times [2018-10-15 12:46:23,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 0 proven. 673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:23,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:23,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:46:23,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:46:23,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:46:23,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1148, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:46:23,604 INFO L87 Difference]: Start difference. First operand 260 states and 276 transitions. Second operand 39 states. [2018-10-15 12:46:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:25,169 INFO L93 Difference]: Finished difference Result 560 states and 577 transitions. [2018-10-15 12:46:25,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 12:46:25,169 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 127 [2018-10-15 12:46:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:25,171 INFO L225 Difference]: With dead ends: 560 [2018-10-15 12:46:25,171 INFO L226 Difference]: Without dead ends: 554 [2018-10-15 12:46:25,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1812, Invalid=6198, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:46:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-15 12:46:25,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 266. [2018-10-15 12:46:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:46:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 12:46:25,175 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 127 [2018-10-15 12:46:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:25,175 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 12:46:25,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:46:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 12:46:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 12:46:25,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:25,176 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:25,176 INFO L424 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:25,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1118110341, now seen corresponding path program 83 times [2018-10-15 12:46:25,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 527 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:25,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:25,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:46:25,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:46:25,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:46:25,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:46:25,677 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 31 states. [2018-10-15 12:46:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:26,394 INFO L93 Difference]: Finished difference Result 566 states and 583 transitions. [2018-10-15 12:46:26,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 12:46:26,394 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 130 [2018-10-15 12:46:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:26,395 INFO L225 Difference]: With dead ends: 566 [2018-10-15 12:46:26,396 INFO L226 Difference]: Without dead ends: 560 [2018-10-15 12:46:26,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=936, Invalid=2724, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:46:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-10-15 12:46:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 266. [2018-10-15 12:46:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:46:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 12:46:26,400 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 130 [2018-10-15 12:46:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:26,400 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 12:46:26,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:46:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 12:46:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 12:46:26,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:26,401 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:26,402 INFO L424 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:26,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:26,402 INFO L82 PathProgramCache]: Analyzing trace with hash -671889638, now seen corresponding path program 84 times [2018-10-15 12:46:26,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:26,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:26,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:46:26,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:46:26,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:46:26,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:46:26,745 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 33 states. [2018-10-15 12:46:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:27,497 INFO L93 Difference]: Finished difference Result 674 states and 691 transitions. [2018-10-15 12:46:27,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:46:27,498 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 130 [2018-10-15 12:46:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:27,499 INFO L225 Difference]: With dead ends: 674 [2018-10-15 12:46:27,499 INFO L226 Difference]: Without dead ends: 668 [2018-10-15 12:46:27,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1042, Invalid=3514, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:46:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-10-15 12:46:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 266. [2018-10-15 12:46:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:46:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 12:46:27,504 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 130 [2018-10-15 12:46:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:27,504 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 12:46:27,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:46:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 12:46:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 12:46:27,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:27,505 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:27,505 INFO L424 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:27,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:27,506 INFO L82 PathProgramCache]: Analyzing trace with hash -654505351, now seen corresponding path program 85 times [2018-10-15 12:46:27,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:27,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:27,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:46:27,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:46:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:46:27,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:46:27,836 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 35 states. [2018-10-15 12:46:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:28,726 INFO L93 Difference]: Finished difference Result 710 states and 727 transitions. [2018-10-15 12:46:28,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 12:46:28,726 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 130 [2018-10-15 12:46:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:28,727 INFO L225 Difference]: With dead ends: 710 [2018-10-15 12:46:28,728 INFO L226 Difference]: Without dead ends: 704 [2018-10-15 12:46:28,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1212, Invalid=4338, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:46:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-10-15 12:46:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 266. [2018-10-15 12:46:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:46:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 12:46:28,732 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 130 [2018-10-15 12:46:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:28,732 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 12:46:28,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:46:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 12:46:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 12:46:28,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:28,733 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:28,733 INFO L424 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:28,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:28,734 INFO L82 PathProgramCache]: Analyzing trace with hash -195709032, now seen corresponding path program 86 times [2018-10-15 12:46:28,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:29,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:29,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:46:29,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:46:29,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:46:29,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:46:29,364 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 37 states. [2018-10-15 12:46:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:30,466 INFO L93 Difference]: Finished difference Result 696 states and 713 transitions. [2018-10-15 12:46:30,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 12:46:30,467 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 130 [2018-10-15 12:46:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:30,468 INFO L225 Difference]: With dead ends: 696 [2018-10-15 12:46:30,468 INFO L226 Difference]: Without dead ends: 690 [2018-10-15 12:46:30,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1446, Invalid=5196, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 12:46:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-10-15 12:46:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 266. [2018-10-15 12:46:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:46:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 12:46:30,473 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 130 [2018-10-15 12:46:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:30,473 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 12:46:30,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:46:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 12:46:30,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 12:46:30,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:30,474 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:30,474 INFO L424 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:30,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:30,475 INFO L82 PathProgramCache]: Analyzing trace with hash 481869431, now seen corresponding path program 87 times [2018-10-15 12:46:30,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 607 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:30,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:30,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:46:30,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:46:30,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:46:30,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1160, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:46:30,911 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 39 states. [2018-10-15 12:46:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:32,164 INFO L93 Difference]: Finished difference Result 624 states and 641 transitions. [2018-10-15 12:46:32,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 12:46:32,164 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 130 [2018-10-15 12:46:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:32,166 INFO L225 Difference]: With dead ends: 624 [2018-10-15 12:46:32,166 INFO L226 Difference]: Without dead ends: 618 [2018-10-15 12:46:32,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1744, Invalid=6088, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:46:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-10-15 12:46:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 266. [2018-10-15 12:46:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:46:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 12:46:32,172 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 130 [2018-10-15 12:46:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:32,172 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 12:46:32,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:46:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 12:46:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 12:46:32,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:32,173 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:32,174 INFO L424 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:32,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2007154119, now seen corresponding path program 88 times [2018-10-15 12:46:32,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 0 proven. 620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:32,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:32,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:46:32,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:46:32,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:46:32,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:46:32,547 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 31 states. [2018-10-15 12:46:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:33,274 INFO L93 Difference]: Finished difference Result 489 states and 506 transitions. [2018-10-15 12:46:33,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:46:33,274 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 133 [2018-10-15 12:46:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:33,276 INFO L225 Difference]: With dead ends: 489 [2018-10-15 12:46:33,276 INFO L226 Difference]: Without dead ends: 483 [2018-10-15 12:46:33,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=960, Invalid=2580, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 12:46:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-10-15 12:46:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 266. [2018-10-15 12:46:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:46:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 12:46:33,280 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 133 [2018-10-15 12:46:33,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:33,280 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 12:46:33,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:46:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 12:46:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 12:46:33,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:33,281 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:33,281 INFO L424 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:33,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:33,282 INFO L82 PathProgramCache]: Analyzing trace with hash 729372424, now seen corresponding path program 89 times [2018-10-15 12:46:33,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:33,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:33,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:46:33,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:46:33,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:46:33,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:46:33,651 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 33 states. [2018-10-15 12:46:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:34,712 INFO L93 Difference]: Finished difference Result 633 states and 650 transitions. [2018-10-15 12:46:34,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:46:34,713 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 133 [2018-10-15 12:46:34,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:34,714 INFO L225 Difference]: With dead ends: 633 [2018-10-15 12:46:34,714 INFO L226 Difference]: Without dead ends: 627 [2018-10-15 12:46:34,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1045, Invalid=3377, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:46:34,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-10-15 12:46:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 266. [2018-10-15 12:46:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:46:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 12:46:34,719 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 133 [2018-10-15 12:46:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:34,720 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 12:46:34,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:46:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 12:46:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 12:46:34,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:34,721 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:34,721 INFO L424 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:34,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:34,721 INFO L82 PathProgramCache]: Analyzing trace with hash 611085961, now seen corresponding path program 90 times [2018-10-15 12:46:34,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:35,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:35,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:46:35,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:46:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:46:35,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:46:35,074 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 35 states. [2018-10-15 12:46:35,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:35,914 INFO L93 Difference]: Finished difference Result 705 states and 722 transitions. [2018-10-15 12:46:35,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:46:35,914 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2018-10-15 12:46:35,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:35,917 INFO L225 Difference]: With dead ends: 705 [2018-10-15 12:46:35,917 INFO L226 Difference]: Without dead ends: 699 [2018-10-15 12:46:35,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1194, Invalid=4208, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 12:46:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-10-15 12:46:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 266. [2018-10-15 12:46:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:46:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 12:46:35,922 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 133 [2018-10-15 12:46:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:35,923 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 12:46:35,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:46:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 12:46:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 12:46:35,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:35,924 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:35,924 INFO L424 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:35,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:35,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2106911670, now seen corresponding path program 91 times [2018-10-15 12:46:35,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:36,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:36,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:46:36,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:46:36,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:46:36,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:46:36,591 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 37 states. [2018-10-15 12:46:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:37,518 INFO L93 Difference]: Finished difference Result 709 states and 726 transitions. [2018-10-15 12:46:37,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:46:37,518 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 133 [2018-10-15 12:46:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:37,520 INFO L225 Difference]: With dead ends: 709 [2018-10-15 12:46:37,520 INFO L226 Difference]: Without dead ends: 703 [2018-10-15 12:46:37,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1407, Invalid=5073, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:46:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-10-15 12:46:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 266. [2018-10-15 12:46:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:46:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 12:46:37,524 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 133 [2018-10-15 12:46:37,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:37,525 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 12:46:37,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:46:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 12:46:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 12:46:37,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:37,526 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:37,526 INFO L424 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:37,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:37,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1643620277, now seen corresponding path program 92 times [2018-10-15 12:46:37,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:37,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:37,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:46:37,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:46:37,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:46:37,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:46:37,985 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 39 states. [2018-10-15 12:46:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:39,181 INFO L93 Difference]: Finished difference Result 673 states and 690 transitions. [2018-10-15 12:46:39,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:46:39,181 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 133 [2018-10-15 12:46:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:39,182 INFO L225 Difference]: With dead ends: 673 [2018-10-15 12:46:39,182 INFO L226 Difference]: Without dead ends: 667 [2018-10-15 12:46:39,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1684, Invalid=5972, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 12:46:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-15 12:46:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 266. [2018-10-15 12:46:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:46:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 12:46:39,187 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 133 [2018-10-15 12:46:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:39,187 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 12:46:39,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:46:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 12:46:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 12:46:39,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:39,188 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:39,188 INFO L424 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:39,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:39,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1451537780, now seen corresponding path program 93 times [2018-10-15 12:46:39,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:39,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:39,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:46:39,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:46:39,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:46:39,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:46:39,984 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 41 states. [2018-10-15 12:46:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:41,317 INFO L93 Difference]: Finished difference Result 574 states and 592 transitions. [2018-10-15 12:46:41,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:46:41,318 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 133 [2018-10-15 12:46:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:41,319 INFO L225 Difference]: With dead ends: 574 [2018-10-15 12:46:41,319 INFO L226 Difference]: Without dead ends: 568 [2018-10-15 12:46:41,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2025, Invalid=6905, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:46:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-15 12:46:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 272. [2018-10-15 12:46:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-15 12:46:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 290 transitions. [2018-10-15 12:46:41,324 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 290 transitions. Word has length 133 [2018-10-15 12:46:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:41,324 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 290 transitions. [2018-10-15 12:46:41,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:46:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 290 transitions. [2018-10-15 12:46:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:46:41,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:41,325 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:41,325 INFO L424 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:41,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:41,326 INFO L82 PathProgramCache]: Analyzing trace with hash -795835919, now seen corresponding path program 13 times [2018-10-15 12:46:41,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:41,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:41,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:46:41,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:46:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:46:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:46:41,630 INFO L87 Difference]: Start difference. First operand 272 states and 290 transitions. Second operand 31 states. [2018-10-15 12:46:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:42,352 INFO L93 Difference]: Finished difference Result 403 states and 421 transitions. [2018-10-15 12:46:42,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:46:42,352 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 136 [2018-10-15 12:46:42,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:42,353 INFO L225 Difference]: With dead ends: 403 [2018-10-15 12:46:42,353 INFO L226 Difference]: Without dead ends: 397 [2018-10-15 12:46:42,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=992, Invalid=2430, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:46:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-15 12:46:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 284. [2018-10-15 12:46:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:46:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 12:46:42,357 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 136 [2018-10-15 12:46:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:42,358 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 12:46:42,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:46:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 12:46:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:46:42,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:42,359 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:42,359 INFO L424 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:42,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:42,359 INFO L82 PathProgramCache]: Analyzing trace with hash -121912880, now seen corresponding path program 94 times [2018-10-15 12:46:42,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 0 proven. 541 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:42,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:42,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:46:42,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:46:42,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:46:42,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:46:42,692 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 33 states. [2018-10-15 12:46:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:43,447 INFO L93 Difference]: Finished difference Result 679 states and 697 transitions. [2018-10-15 12:46:43,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 12:46:43,447 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 136 [2018-10-15 12:46:43,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:43,448 INFO L225 Difference]: With dead ends: 679 [2018-10-15 12:46:43,448 INFO L226 Difference]: Without dead ends: 673 [2018-10-15 12:46:43,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1056, Invalid=3234, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 12:46:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-15 12:46:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 284. [2018-10-15 12:46:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:46:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 12:46:43,452 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 136 [2018-10-15 12:46:43,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:43,453 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 12:46:43,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:46:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 12:46:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:46:43,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:43,453 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:43,453 INFO L424 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:43,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:43,454 INFO L82 PathProgramCache]: Analyzing trace with hash 324307823, now seen corresponding path program 95 times [2018-10-15 12:46:43,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:43,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:43,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:46:43,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:46:43,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:46:43,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:46:43,798 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 35 states. [2018-10-15 12:46:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:44,832 INFO L93 Difference]: Finished difference Result 769 states and 787 transitions. [2018-10-15 12:46:44,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 12:46:44,833 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 136 [2018-10-15 12:46:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:44,833 INFO L225 Difference]: With dead ends: 769 [2018-10-15 12:46:44,834 INFO L226 Difference]: Without dead ends: 763 [2018-10-15 12:46:44,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1184, Invalid=4072, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:46:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-10-15 12:46:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 284. [2018-10-15 12:46:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:46:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 12:46:44,837 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 136 [2018-10-15 12:46:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:44,838 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 12:46:44,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:46:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 12:46:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:46:44,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:44,838 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:44,839 INFO L424 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:44,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:44,839 INFO L82 PathProgramCache]: Analyzing trace with hash 341692110, now seen corresponding path program 96 times [2018-10-15 12:46:44,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:45,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:45,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:46:45,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:46:45,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:46:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:46:45,205 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 37 states. [2018-10-15 12:46:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:46,193 INFO L93 Difference]: Finished difference Result 787 states and 805 transitions. [2018-10-15 12:46:46,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 12:46:46,193 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 136 [2018-10-15 12:46:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:46,194 INFO L225 Difference]: With dead ends: 787 [2018-10-15 12:46:46,194 INFO L226 Difference]: Without dead ends: 781 [2018-10-15 12:46:46,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1376, Invalid=4944, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 12:46:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2018-10-15 12:46:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 284. [2018-10-15 12:46:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:46:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 12:46:46,199 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 136 [2018-10-15 12:46:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:46,199 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 12:46:46,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:46:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 12:46:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:46:46,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:46,200 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:46,200 INFO L424 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:46,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:46,200 INFO L82 PathProgramCache]: Analyzing trace with hash 800488429, now seen corresponding path program 97 times [2018-10-15 12:46:46,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:46,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:46,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:46:46,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:46:46,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:46:46,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1178, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:46:46,633 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 39 states. [2018-10-15 12:46:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:47,742 INFO L93 Difference]: Finished difference Result 764 states and 782 transitions. [2018-10-15 12:46:47,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 12:46:47,742 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 136 [2018-10-15 12:46:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:47,743 INFO L225 Difference]: With dead ends: 764 [2018-10-15 12:46:47,744 INFO L226 Difference]: Without dead ends: 758 [2018-10-15 12:46:47,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1632, Invalid=5850, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:46:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-10-15 12:46:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 284. [2018-10-15 12:46:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:46:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 12:46:47,747 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 136 [2018-10-15 12:46:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:47,748 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 12:46:47,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:46:47,748 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 12:46:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:46:47,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:47,749 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:47,749 INFO L424 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:47,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1478066892, now seen corresponding path program 98 times [2018-10-15 12:46:47,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:48,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:48,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:46:48,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:46:48,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:46:48,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1282, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:46:48,203 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 41 states. [2018-10-15 12:46:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:49,785 INFO L93 Difference]: Finished difference Result 674 states and 692 transitions. [2018-10-15 12:46:49,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 12:46:49,786 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 136 [2018-10-15 12:46:49,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:49,787 INFO L225 Difference]: With dead ends: 674 [2018-10-15 12:46:49,787 INFO L226 Difference]: Without dead ends: 668 [2018-10-15 12:46:49,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1952, Invalid=6790, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 12:46:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-10-15 12:46:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 284. [2018-10-15 12:46:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:46:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 12:46:49,791 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 136 [2018-10-15 12:46:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:49,792 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 12:46:49,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:46:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 12:46:49,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:46:49,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:49,793 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:49,793 INFO L424 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:49,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1501699410, now seen corresponding path program 99 times [2018-10-15 12:46:49,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 0 proven. 628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:50,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:50,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:46:50,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:46:50,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:46:50,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:46:50,120 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 33 states. [2018-10-15 12:46:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:50,774 INFO L93 Difference]: Finished difference Result 611 states and 629 transitions. [2018-10-15 12:46:50,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 12:46:50,775 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 139 [2018-10-15 12:46:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:50,775 INFO L225 Difference]: With dead ends: 611 [2018-10-15 12:46:50,776 INFO L226 Difference]: Without dead ends: 605 [2018-10-15 12:46:50,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1075, Invalid=3085, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:46:50,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-10-15 12:46:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 284. [2018-10-15 12:46:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:46:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 12:46:50,780 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 139 [2018-10-15 12:46:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:50,780 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 12:46:50,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:46:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 12:46:50,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:46:50,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:50,781 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:50,781 INFO L424 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:50,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:50,782 INFO L82 PathProgramCache]: Analyzing trace with hash 223917715, now seen corresponding path program 100 times [2018-10-15 12:46:50,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:51,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:51,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:46:51,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:46:51,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:46:51,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:46:51,112 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 35 states. [2018-10-15 12:46:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:51,991 INFO L93 Difference]: Finished difference Result 737 states and 755 transitions. [2018-10-15 12:46:51,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 12:46:51,992 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-10-15 12:46:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:51,993 INFO L225 Difference]: With dead ends: 737 [2018-10-15 12:46:51,993 INFO L226 Difference]: Without dead ends: 731 [2018-10-15 12:46:51,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1182, Invalid=3930, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 12:46:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-10-15 12:46:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 284. [2018-10-15 12:46:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:46:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 12:46:51,997 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 139 [2018-10-15 12:46:51,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:51,998 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 12:46:51,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:46:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 12:46:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:46:51,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:51,998 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:51,998 INFO L424 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:51,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:51,999 INFO L82 PathProgramCache]: Analyzing trace with hash 105631252, now seen corresponding path program 101 times [2018-10-15 12:46:51,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:52,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:52,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:46:52,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:46:52,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:46:52,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:46:52,357 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 37 states. [2018-10-15 12:46:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:53,291 INFO L93 Difference]: Finished difference Result 791 states and 809 transitions. [2018-10-15 12:46:53,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 12:46:53,291 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 139 [2018-10-15 12:46:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:53,292 INFO L225 Difference]: With dead ends: 791 [2018-10-15 12:46:53,292 INFO L226 Difference]: Without dead ends: 785 [2018-10-15 12:46:53,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1353, Invalid=4809, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:46:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-10-15 12:46:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 284. [2018-10-15 12:46:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:46:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 12:46:53,297 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 139 [2018-10-15 12:46:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:53,297 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 12:46:53,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:46:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 12:46:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:46:53,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:53,298 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:53,298 INFO L424 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:53,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:53,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1682600917, now seen corresponding path program 102 times [2018-10-15 12:46:53,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:53,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:53,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:46:53,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:46:53,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:46:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1184, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:46:53,703 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 39 states. [2018-10-15 12:46:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:54,980 INFO L93 Difference]: Finished difference Result 786 states and 804 transitions. [2018-10-15 12:46:54,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 12:46:54,980 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 139 [2018-10-15 12:46:54,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:54,981 INFO L225 Difference]: With dead ends: 786 [2018-10-15 12:46:54,981 INFO L226 Difference]: Without dead ends: 780 [2018-10-15 12:46:54,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1588, Invalid=5722, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 12:46:54,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-10-15 12:46:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 284. [2018-10-15 12:46:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:46:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 12:46:54,985 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 139 [2018-10-15 12:46:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:54,985 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 12:46:54,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:46:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 12:46:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:46:54,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:54,986 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:54,986 INFO L424 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:54,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:54,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2145892310, now seen corresponding path program 103 times [2018-10-15 12:46:54,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 0 proven. 636 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:55,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:55,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:46:55,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:46:55,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:46:55,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:46:55,451 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 41 states. [2018-10-15 12:46:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:56,737 INFO L93 Difference]: Finished difference Result 732 states and 750 transitions. [2018-10-15 12:46:56,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 12:46:56,737 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 139 [2018-10-15 12:46:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:56,738 INFO L225 Difference]: With dead ends: 732 [2018-10-15 12:46:56,738 INFO L226 Difference]: Without dead ends: 726 [2018-10-15 12:46:56,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1887, Invalid=6669, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:46:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-10-15 12:46:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 284. [2018-10-15 12:46:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:46:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 12:46:56,743 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 139 [2018-10-15 12:46:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:56,743 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 12:46:56,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:46:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 12:46:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:46:56,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:56,744 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:56,744 INFO L424 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:56,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1956992489, now seen corresponding path program 104 times [2018-10-15 12:46:56,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:57,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:57,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:46:57,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:46:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:46:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:46:57,257 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 43 states. [2018-10-15 12:46:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:58,815 INFO L93 Difference]: Finished difference Result 615 states and 634 transitions. [2018-10-15 12:46:58,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 12:46:58,815 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 139 [2018-10-15 12:46:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:58,816 INFO L225 Difference]: With dead ends: 615 [2018-10-15 12:46:58,816 INFO L226 Difference]: Without dead ends: 609 [2018-10-15 12:46:58,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2250, Invalid=7650, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 12:46:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-10-15 12:46:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 290. [2018-10-15 12:46:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:46:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 12:46:58,821 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 139 [2018-10-15 12:46:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:58,821 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 12:46:58,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:46:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 12:46:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:46:58,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:58,822 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:58,822 INFO L424 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:58,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:58,822 INFO L82 PathProgramCache]: Analyzing trace with hash -641731962, now seen corresponding path program 105 times [2018-10-15 12:46:58,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 0 proven. 730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:59,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:59,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:46:59,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:46:59,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:46:59,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:46:59,254 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 33 states. [2018-10-15 12:47:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:00,248 INFO L93 Difference]: Finished difference Result 531 states and 550 transitions. [2018-10-15 12:47:00,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:47:00,249 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 142 [2018-10-15 12:47:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:00,250 INFO L225 Difference]: With dead ends: 531 [2018-10-15 12:47:00,250 INFO L226 Difference]: Without dead ends: 525 [2018-10-15 12:47:00,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1102, Invalid=2930, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 12:47:00,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-15 12:47:00,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 290. [2018-10-15 12:47:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:47:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 12:47:00,254 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 142 [2018-10-15 12:47:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:00,254 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 12:47:00,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:47:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 12:47:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:47:00,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:00,255 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:00,255 INFO L424 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:00,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:00,255 INFO L82 PathProgramCache]: Analyzing trace with hash 32191077, now seen corresponding path program 106 times [2018-10-15 12:47:00,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:00,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:00,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:47:00,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:47:00,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:47:00,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:47:00,582 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 35 states. [2018-10-15 12:47:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:01,425 INFO L93 Difference]: Finished difference Result 693 states and 712 transitions. [2018-10-15 12:47:01,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:47:01,426 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2018-10-15 12:47:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:01,427 INFO L225 Difference]: With dead ends: 693 [2018-10-15 12:47:01,427 INFO L226 Difference]: Without dead ends: 687 [2018-10-15 12:47:01,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1188, Invalid=3782, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:47:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-10-15 12:47:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 290. [2018-10-15 12:47:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:47:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 12:47:01,431 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 142 [2018-10-15 12:47:01,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:01,431 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 12:47:01,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:47:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 12:47:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:47:01,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:01,432 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:01,432 INFO L424 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:01,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:01,433 INFO L82 PathProgramCache]: Analyzing trace with hash 478411780, now seen corresponding path program 107 times [2018-10-15 12:47:01,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:01,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:01,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:47:01,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:47:01,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:47:01,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:47:01,824 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 37 states. [2018-10-15 12:47:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:02,767 INFO L93 Difference]: Finished difference Result 783 states and 802 transitions. [2018-10-15 12:47:02,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:47:02,767 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 142 [2018-10-15 12:47:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:02,768 INFO L225 Difference]: With dead ends: 783 [2018-10-15 12:47:02,768 INFO L226 Difference]: Without dead ends: 777 [2018-10-15 12:47:02,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1338, Invalid=4668, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 12:47:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-10-15 12:47:02,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 290. [2018-10-15 12:47:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:47:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 12:47:02,772 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 142 [2018-10-15 12:47:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:02,772 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 12:47:02,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:47:02,773 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 12:47:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:47:02,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:02,773 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:02,773 INFO L424 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:02,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:02,774 INFO L82 PathProgramCache]: Analyzing trace with hash 495796067, now seen corresponding path program 108 times [2018-10-15 12:47:02,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:03,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:03,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:47:03,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:47:03,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:47:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1188, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:47:03,239 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 39 states. [2018-10-15 12:47:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:04,292 INFO L93 Difference]: Finished difference Result 801 states and 820 transitions. [2018-10-15 12:47:04,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:47:04,292 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 142 [2018-10-15 12:47:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:04,293 INFO L225 Difference]: With dead ends: 801 [2018-10-15 12:47:04,293 INFO L226 Difference]: Without dead ends: 795 [2018-10-15 12:47:04,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1552, Invalid=5588, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:47:04,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-10-15 12:47:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 290. [2018-10-15 12:47:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:47:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 12:47:04,297 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 142 [2018-10-15 12:47:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:04,297 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 12:47:04,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:47:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 12:47:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:47:04,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:04,298 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:04,298 INFO L424 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:04,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:04,299 INFO L82 PathProgramCache]: Analyzing trace with hash 954592386, now seen corresponding path program 109 times [2018-10-15 12:47:04,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:05,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:05,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:47:05,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:47:05,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:47:05,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1302, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:47:05,192 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 41 states. [2018-10-15 12:47:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:06,495 INFO L93 Difference]: Finished difference Result 778 states and 797 transitions. [2018-10-15 12:47:06,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:47:06,496 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 142 [2018-10-15 12:47:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:06,497 INFO L225 Difference]: With dead ends: 778 [2018-10-15 12:47:06,497 INFO L226 Difference]: Without dead ends: 772 [2018-10-15 12:47:06,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1830, Invalid=6542, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 12:47:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-10-15 12:47:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 290. [2018-10-15 12:47:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:47:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 12:47:06,502 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 142 [2018-10-15 12:47:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:06,502 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 12:47:06,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:47:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 12:47:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:47:06,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:06,503 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:06,503 INFO L424 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:06,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:06,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1632170849, now seen corresponding path program 110 times [2018-10-15 12:47:06,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:07,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:07,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:47:07,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:47:07,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:47:07,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1410, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:47:07,018 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 43 states. [2018-10-15 12:47:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:08,471 INFO L93 Difference]: Finished difference Result 688 states and 707 transitions. [2018-10-15 12:47:08,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:47:08,472 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 142 [2018-10-15 12:47:08,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:08,472 INFO L225 Difference]: With dead ends: 688 [2018-10-15 12:47:08,473 INFO L226 Difference]: Without dead ends: 682 [2018-10-15 12:47:08,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1986 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2172, Invalid=7530, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:47:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-10-15 12:47:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 290. [2018-10-15 12:47:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:47:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 12:47:08,477 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 142 [2018-10-15 12:47:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:08,477 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 12:47:08,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:47:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 12:47:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:47:08,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:08,478 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:08,478 INFO L424 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:08,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:08,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1977926244, now seen corresponding path program 14 times [2018-10-15 12:47:08,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 0 proven. 847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:08,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:08,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:47:08,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:47:08,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:47:08,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=797, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:47:08,786 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 33 states. [2018-10-15 12:47:09,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:09,407 INFO L93 Difference]: Finished difference Result 430 states and 449 transitions. [2018-10-15 12:47:09,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:47:09,408 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 145 [2018-10-15 12:47:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:09,409 INFO L225 Difference]: With dead ends: 430 [2018-10-15 12:47:09,409 INFO L226 Difference]: Without dead ends: 424 [2018-10-15 12:47:09,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1137, Invalid=2769, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:47:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-10-15 12:47:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 302. [2018-10-15 12:47:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 12:47:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 321 transitions. [2018-10-15 12:47:09,412 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 321 transitions. Word has length 145 [2018-10-15 12:47:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:09,413 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 321 transitions. [2018-10-15 12:47:09,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:47:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 321 transitions. [2018-10-15 12:47:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:47:09,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:09,414 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:09,414 INFO L424 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:09,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1092642973, now seen corresponding path program 111 times [2018-10-15 12:47:09,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 0 proven. 642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:09,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:09,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:47:09,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:47:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:47:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=934, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:47:09,746 INFO L87 Difference]: Start difference. First operand 302 states and 321 transitions. Second operand 35 states. [2018-10-15 12:47:10,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:10,762 INFO L93 Difference]: Finished difference Result 733 states and 752 transitions. [2018-10-15 12:47:10,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 12:47:10,763 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 145 [2018-10-15 12:47:10,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:10,764 INFO L225 Difference]: With dead ends: 733 [2018-10-15 12:47:10,764 INFO L226 Difference]: Without dead ends: 727 [2018-10-15 12:47:10,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1202, Invalid=3628, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 12:47:10,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-15 12:47:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 302. [2018-10-15 12:47:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 12:47:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 321 transitions. [2018-10-15 12:47:10,768 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 321 transitions. Word has length 145 [2018-10-15 12:47:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:10,768 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 321 transitions. [2018-10-15 12:47:10,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:47:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 321 transitions. [2018-10-15 12:47:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:47:10,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:10,769 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:10,769 INFO L424 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:10,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:10,769 INFO L82 PathProgramCache]: Analyzing trace with hash -185138722, now seen corresponding path program 112 times [2018-10-15 12:47:10,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 527 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:11,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:11,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:47:11,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:47:11,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:47:11,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:47:11,166 INFO L87 Difference]: Start difference. First operand 302 states and 321 transitions. Second operand 37 states. [2018-10-15 12:47:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:12,111 INFO L93 Difference]: Finished difference Result 841 states and 860 transitions. [2018-10-15 12:47:12,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 12:47:12,112 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 145 [2018-10-15 12:47:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:12,113 INFO L225 Difference]: With dead ends: 841 [2018-10-15 12:47:12,113 INFO L226 Difference]: Without dead ends: 835 [2018-10-15 12:47:12,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1331, Invalid=4521, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:47:12,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-10-15 12:47:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 302. [2018-10-15 12:47:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 12:47:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 321 transitions. [2018-10-15 12:47:12,119 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 321 transitions. Word has length 145 [2018-10-15 12:47:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:12,119 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 321 transitions. [2018-10-15 12:47:12,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:47:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 321 transitions. [2018-10-15 12:47:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:47:12,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:12,120 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:12,120 INFO L424 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:12,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash -303425185, now seen corresponding path program 113 times [2018-10-15 12:47:12,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 502 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:12,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:12,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:47:12,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:47:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:47:12,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:47:12,572 INFO L87 Difference]: Start difference. First operand 302 states and 321 transitions. Second operand 39 states. [2018-10-15 12:47:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:13,675 INFO L93 Difference]: Finished difference Result 877 states and 896 transitions. [2018-10-15 12:47:13,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 12:47:13,675 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 145 [2018-10-15 12:47:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:13,676 INFO L225 Difference]: With dead ends: 877 [2018-10-15 12:47:13,676 INFO L226 Difference]: Without dead ends: 871 [2018-10-15 12:47:13,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1524, Invalid=5448, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 12:47:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-15 12:47:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 302. [2018-10-15 12:47:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 12:47:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 321 transitions. [2018-10-15 12:47:13,682 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 321 transitions. Word has length 145 [2018-10-15 12:47:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:13,682 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 321 transitions. [2018-10-15 12:47:13,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:47:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 321 transitions. [2018-10-15 12:47:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:47:13,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:13,683 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:13,683 INFO L424 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:13,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:13,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1273544480, now seen corresponding path program 114 times [2018-10-15 12:47:13,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 0 proven. 567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:14,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:14,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:47:14,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:47:14,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:47:14,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:47:14,126 INFO L87 Difference]: Start difference. First operand 302 states and 321 transitions. Second operand 41 states. [2018-10-15 12:47:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:15,482 INFO L93 Difference]: Finished difference Result 863 states and 882 transitions. [2018-10-15 12:47:15,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 12:47:15,482 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 145 [2018-10-15 12:47:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:15,483 INFO L225 Difference]: With dead ends: 863 [2018-10-15 12:47:15,483 INFO L226 Difference]: Without dead ends: 857 [2018-10-15 12:47:15,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1686 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1781, Invalid=6409, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:47:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-10-15 12:47:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 302. [2018-10-15 12:47:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 12:47:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 321 transitions. [2018-10-15 12:47:15,488 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 321 transitions. Word has length 145 [2018-10-15 12:47:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:15,488 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 321 transitions. [2018-10-15 12:47:15,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:47:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 321 transitions. [2018-10-15 12:47:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:47:15,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:15,489 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:15,489 INFO L424 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:15,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1736835873, now seen corresponding path program 115 times [2018-10-15 12:47:15,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:16,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:16,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:47:16,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:47:16,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:47:16,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1422, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:47:16,113 INFO L87 Difference]: Start difference. First operand 302 states and 321 transitions. Second operand 43 states. [2018-10-15 12:47:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:17,511 INFO L93 Difference]: Finished difference Result 791 states and 810 transitions. [2018-10-15 12:47:17,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 12:47:17,511 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 145 [2018-10-15 12:47:17,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:17,512 INFO L225 Difference]: With dead ends: 791 [2018-10-15 12:47:17,512 INFO L226 Difference]: Without dead ends: 785 [2018-10-15 12:47:17,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1950 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2102, Invalid=7404, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 12:47:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-10-15 12:47:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 302. [2018-10-15 12:47:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 12:47:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 321 transitions. [2018-10-15 12:47:17,517 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 321 transitions. Word has length 145 [2018-10-15 12:47:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:17,517 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 321 transitions. [2018-10-15 12:47:17,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:47:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 321 transitions. [2018-10-15 12:47:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:47:17,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:17,518 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:17,518 INFO L424 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:17,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:17,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1928918370, now seen corresponding path program 116 times [2018-10-15 12:47:17,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 0 proven. 967 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:18,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:18,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:47:18,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:47:18,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:47:18,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1529, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:47:18,072 INFO L87 Difference]: Start difference. First operand 302 states and 321 transitions. Second operand 45 states. [2018-10-15 12:47:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:19,745 INFO L93 Difference]: Finished difference Result 656 states and 676 transitions. [2018-10-15 12:47:19,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 12:47:19,746 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 145 [2018-10-15 12:47:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:19,746 INFO L225 Difference]: With dead ends: 656 [2018-10-15 12:47:19,747 INFO L226 Difference]: Without dead ends: 650 [2018-10-15 12:47:19,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2241 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2487, Invalid=8433, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:47:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-15 12:47:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 308. [2018-10-15 12:47:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:19,751 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 145 [2018-10-15 12:47:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:19,751 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:19,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:47:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 12:47:19,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:19,752 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:19,752 INFO L424 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:19,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:19,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2019827877, now seen corresponding path program 117 times [2018-10-15 12:47:19,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:20,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:20,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:47:20,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:47:20,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:47:20,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=924, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:47:20,108 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 35 states. [2018-10-15 12:47:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:21,180 INFO L93 Difference]: Finished difference Result 662 states and 682 transitions. [2018-10-15 12:47:21,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:47:21,180 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 148 [2018-10-15 12:47:21,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:21,181 INFO L225 Difference]: With dead ends: 662 [2018-10-15 12:47:21,181 INFO L226 Difference]: Without dead ends: 656 [2018-10-15 12:47:21,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:47:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-10-15 12:47:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 308. [2018-10-15 12:47:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:21,185 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 148 [2018-10-15 12:47:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:21,186 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:21,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:47:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 12:47:21,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:21,187 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:21,187 INFO L424 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:21,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:21,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1345904838, now seen corresponding path program 118 times [2018-10-15 12:47:21,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 587 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:21,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:21,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:47:21,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:47:21,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:47:21,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:47:21,705 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 37 states. [2018-10-15 12:47:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:22,611 INFO L93 Difference]: Finished difference Result 806 states and 826 transitions. [2018-10-15 12:47:22,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 12:47:22,612 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 148 [2018-10-15 12:47:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:22,613 INFO L225 Difference]: With dead ends: 806 [2018-10-15 12:47:22,613 INFO L226 Difference]: Without dead ends: 800 [2018-10-15 12:47:22,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1332, Invalid=4368, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 12:47:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-10-15 12:47:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 308. [2018-10-15 12:47:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:22,617 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 148 [2018-10-15 12:47:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:22,618 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:22,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:47:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 12:47:22,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:22,618 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:22,619 INFO L424 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:22,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:22,619 INFO L82 PathProgramCache]: Analyzing trace with hash -899684135, now seen corresponding path program 119 times [2018-10-15 12:47:22,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:23,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:23,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:47:23,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:47:23,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:47:23,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:47:23,035 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 39 states. [2018-10-15 12:47:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:24,189 INFO L93 Difference]: Finished difference Result 878 states and 898 transitions. [2018-10-15 12:47:24,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 12:47:24,190 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2018-10-15 12:47:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:24,191 INFO L225 Difference]: With dead ends: 878 [2018-10-15 12:47:24,191 INFO L226 Difference]: Without dead ends: 872 [2018-10-15 12:47:24,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1504, Invalid=5302, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:47:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-10-15 12:47:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 308. [2018-10-15 12:47:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:24,195 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 148 [2018-10-15 12:47:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:24,195 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:24,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:47:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 12:47:24,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:24,196 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:24,196 INFO L424 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:24,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:24,197 INFO L82 PathProgramCache]: Analyzing trace with hash -882299848, now seen corresponding path program 120 times [2018-10-15 12:47:24,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:24,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:24,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:47:24,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:47:24,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:47:24,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:47:24,639 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 41 states. [2018-10-15 12:47:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:25,999 INFO L93 Difference]: Finished difference Result 882 states and 902 transitions. [2018-10-15 12:47:25,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 12:47:26,000 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 148 [2018-10-15 12:47:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:26,001 INFO L225 Difference]: With dead ends: 882 [2018-10-15 12:47:26,001 INFO L226 Difference]: Without dead ends: 876 [2018-10-15 12:47:26,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1740, Invalid=6270, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:47:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-10-15 12:47:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 308. [2018-10-15 12:47:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:26,005 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 148 [2018-10-15 12:47:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:26,005 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:26,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:47:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 12:47:26,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:26,006 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:26,006 INFO L424 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:26,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:26,006 INFO L82 PathProgramCache]: Analyzing trace with hash -423503529, now seen corresponding path program 121 times [2018-10-15 12:47:26,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 0 proven. 674 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:26,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:26,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:47:26,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:47:26,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:47:26,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:47:26,509 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 43 states. [2018-10-15 12:47:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:27,875 INFO L93 Difference]: Finished difference Result 846 states and 866 transitions. [2018-10-15 12:47:27,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 12:47:27,875 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 148 [2018-10-15 12:47:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:27,876 INFO L225 Difference]: With dead ends: 846 [2018-10-15 12:47:27,876 INFO L226 Difference]: Without dead ends: 840 [2018-10-15 12:47:27,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2040, Invalid=7272, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:47:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-10-15 12:47:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 308. [2018-10-15 12:47:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:27,881 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 148 [2018-10-15 12:47:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:27,881 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:27,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:47:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 12:47:27,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:27,882 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:27,882 INFO L424 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:27,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash 254074934, now seen corresponding path program 122 times [2018-10-15 12:47:27,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 0 proven. 883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:28,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:28,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:47:28,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:47:28,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:47:28,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=1544, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:47:28,558 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 45 states. [2018-10-15 12:47:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:30,010 INFO L93 Difference]: Finished difference Result 738 states and 758 transitions. [2018-10-15 12:47:30,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 12:47:30,010 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 148 [2018-10-15 12:47:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:30,011 INFO L225 Difference]: With dead ends: 738 [2018-10-15 12:47:30,011 INFO L226 Difference]: Without dead ends: 732 [2018-10-15 12:47:30,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2201 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2404, Invalid=8308, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 12:47:30,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-10-15 12:47:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 308. [2018-10-15 12:47:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:30,016 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 148 [2018-10-15 12:47:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:30,016 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:30,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:47:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 12:47:30,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:30,017 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:30,017 INFO L424 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:30,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:30,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1240947545, now seen corresponding path program 123 times [2018-10-15 12:47:30,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 0 proven. 849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:30,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:30,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:47:30,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:47:30,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:47:30,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:47:30,407 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 35 states. [2018-10-15 12:47:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:31,338 INFO L93 Difference]: Finished difference Result 567 states and 587 transitions. [2018-10-15 12:47:31,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:47:31,338 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 151 [2018-10-15 12:47:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:31,339 INFO L225 Difference]: With dead ends: 567 [2018-10-15 12:47:31,339 INFO L226 Difference]: Without dead ends: 561 [2018-10-15 12:47:31,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1254, Invalid=3302, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:47:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-10-15 12:47:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 308. [2018-10-15 12:47:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:31,345 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 151 [2018-10-15 12:47:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:31,346 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:31,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:47:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:31,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 12:47:31,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:31,347 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:31,347 INFO L424 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:31,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:31,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1829621672, now seen corresponding path program 124 times [2018-10-15 12:47:31,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:31,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:31,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:47:31,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:47:31,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:47:31,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1053, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:47:31,797 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 37 states. [2018-10-15 12:47:32,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:32,710 INFO L93 Difference]: Finished difference Result 747 states and 767 transitions. [2018-10-15 12:47:32,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:47:32,711 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 151 [2018-10-15 12:47:32,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:32,711 INFO L225 Difference]: With dead ends: 747 [2018-10-15 12:47:32,712 INFO L226 Difference]: Without dead ends: 741 [2018-10-15 12:47:32,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1341, Invalid=4209, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:47:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-10-15 12:47:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 308. [2018-10-15 12:47:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:32,716 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 151 [2018-10-15 12:47:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:32,716 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:32,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:47:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 12:47:32,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:32,717 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:32,717 INFO L424 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:32,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:32,717 INFO L82 PathProgramCache]: Analyzing trace with hash 551839977, now seen corresponding path program 125 times [2018-10-15 12:47:32,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:33,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:33,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:47:33,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:47:33,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:47:33,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1188, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:47:33,117 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 39 states. [2018-10-15 12:47:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:34,164 INFO L93 Difference]: Finished difference Result 855 states and 875 transitions. [2018-10-15 12:47:34,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:47:34,165 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 151 [2018-10-15 12:47:34,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:34,166 INFO L225 Difference]: With dead ends: 855 [2018-10-15 12:47:34,166 INFO L226 Difference]: Without dead ends: 849 [2018-10-15 12:47:34,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1492, Invalid=5150, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 12:47:34,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-10-15 12:47:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 308. [2018-10-15 12:47:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:34,171 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 151 [2018-10-15 12:47:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:34,171 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:34,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:47:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 12:47:34,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:34,172 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:34,172 INFO L424 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:34,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:34,172 INFO L82 PathProgramCache]: Analyzing trace with hash 433553514, now seen corresponding path program 126 times [2018-10-15 12:47:34,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:34,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:34,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:47:34,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:47:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:47:34,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1317, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:47:34,605 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 41 states. [2018-10-15 12:47:35,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:35,858 INFO L93 Difference]: Finished difference Result 891 states and 911 transitions. [2018-10-15 12:47:35,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:47:35,859 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 151 [2018-10-15 12:47:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:35,860 INFO L225 Difference]: With dead ends: 891 [2018-10-15 12:47:35,860 INFO L226 Difference]: Without dead ends: 885 [2018-10-15 12:47:35,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1707, Invalid=6125, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:47:35,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-10-15 12:47:35,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 308. [2018-10-15 12:47:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:35,865 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 151 [2018-10-15 12:47:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:35,865 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:35,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:47:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 12:47:35,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:35,866 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:35,866 INFO L424 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:35,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:35,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2010523179, now seen corresponding path program 127 times [2018-10-15 12:47:35,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 0 proven. 641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:36,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:36,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:47:36,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:47:36,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:47:36,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1440, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:47:36,348 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 43 states. [2018-10-15 12:47:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:37,694 INFO L93 Difference]: Finished difference Result 877 states and 897 transitions. [2018-10-15 12:47:37,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:47:37,694 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 151 [2018-10-15 12:47:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:37,695 INFO L225 Difference]: With dead ends: 877 [2018-10-15 12:47:37,695 INFO L226 Difference]: Without dead ends: 871 [2018-10-15 12:47:37,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1884 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1986, Invalid=7134, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 12:47:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-15 12:47:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 308. [2018-10-15 12:47:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:37,700 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 151 [2018-10-15 12:47:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:37,700 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:37,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:47:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 12:47:37,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:37,700 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:37,701 INFO L424 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:37,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:37,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1821152724, now seen corresponding path program 128 times [2018-10-15 12:47:37,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 0 proven. 814 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:38,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:38,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:47:38,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:47:38,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:47:38,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1557, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:47:38,391 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 45 states. [2018-10-15 12:47:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:39,898 INFO L93 Difference]: Finished difference Result 805 states and 825 transitions. [2018-10-15 12:47:39,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:47:39,898 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 151 [2018-10-15 12:47:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:39,899 INFO L225 Difference]: With dead ends: 805 [2018-10-15 12:47:39,899 INFO L226 Difference]: Without dead ends: 799 [2018-10-15 12:47:39,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2163 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2329, Invalid=8177, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:47:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-10-15 12:47:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 308. [2018-10-15 12:47:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:47:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 12:47:39,904 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 151 [2018-10-15 12:47:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:39,904 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 12:47:39,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:47:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 12:47:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 12:47:39,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:39,905 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:39,905 INFO L424 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:39,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:39,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1629070227, now seen corresponding path program 129 times [2018-10-15 12:47:39,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:40,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:40,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:47:40,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:47:40,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:47:40,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=1668, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:47:40,502 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 47 states. [2018-10-15 12:47:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:42,416 INFO L93 Difference]: Finished difference Result 670 states and 691 transitions. [2018-10-15 12:47:42,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:47:42,417 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 151 [2018-10-15 12:47:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:42,417 INFO L225 Difference]: With dead ends: 670 [2018-10-15 12:47:42,418 INFO L226 Difference]: Without dead ends: 664 [2018-10-15 12:47:42,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2469 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2736, Invalid=9254, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 12:47:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-10-15 12:47:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 314. [2018-10-15 12:47:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-15 12:47:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 335 transitions. [2018-10-15 12:47:42,422 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 335 transitions. Word has length 151 [2018-10-15 12:47:42,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:42,422 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 335 transitions. [2018-10-15 12:47:42,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:47:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 335 transitions. [2018-10-15 12:47:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:47:42,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:42,423 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:42,423 INFO L424 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:42,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1098812847, now seen corresponding path program 15 times [2018-10-15 12:47:42,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:42,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:42,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:47:42,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:47:42,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:47:42,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:47:42,769 INFO L87 Difference]: Start difference. First operand 314 states and 335 transitions. Second operand 35 states. [2018-10-15 12:47:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:43,558 INFO L93 Difference]: Finished difference Result 463 states and 484 transitions. [2018-10-15 12:47:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 12:47:43,559 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 154 [2018-10-15 12:47:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:43,560 INFO L225 Difference]: With dead ends: 463 [2018-10-15 12:47:43,560 INFO L226 Difference]: Without dead ends: 457 [2018-10-15 12:47:43,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1292, Invalid=3130, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:47:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-10-15 12:47:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 326. [2018-10-15 12:47:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:47:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:47:43,564 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 12:47:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:43,564 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:47:43,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:47:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:47:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:47:43,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:43,565 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:43,565 INFO L424 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:43,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:43,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1734744176, now seen corresponding path program 130 times [2018-10-15 12:47:43,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:43,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:43,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:47:43,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:47:43,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:47:43,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:47:43,947 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 37 states. [2018-10-15 12:47:44,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:44,887 INFO L93 Difference]: Finished difference Result 793 states and 814 transitions. [2018-10-15 12:47:44,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 12:47:44,888 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 154 [2018-10-15 12:47:44,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:44,889 INFO L225 Difference]: With dead ends: 793 [2018-10-15 12:47:44,889 INFO L226 Difference]: Without dead ends: 787 [2018-10-15 12:47:44,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1358, Invalid=4044, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 12:47:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-10-15 12:47:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 326. [2018-10-15 12:47:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:47:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:47:44,894 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 12:47:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:44,894 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:47:44,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:47:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:47:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:47:44,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:44,895 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:44,895 INFO L424 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:44,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:44,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1886300081, now seen corresponding path program 131 times [2018-10-15 12:47:44,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:45,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:45,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:47:45,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:47:45,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:47:45,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1184, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:47:45,301 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 39 states. [2018-10-15 12:47:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:46,484 INFO L93 Difference]: Finished difference Result 919 states and 940 transitions. [2018-10-15 12:47:46,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 12:47:46,485 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 154 [2018-10-15 12:47:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:46,486 INFO L225 Difference]: With dead ends: 919 [2018-10-15 12:47:46,486 INFO L226 Difference]: Without dead ends: 913 [2018-10-15 12:47:46,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1488, Invalid=4992, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:47:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-10-15 12:47:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 326. [2018-10-15 12:47:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:47:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:47:46,490 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 12:47:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:46,490 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:47:46,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:47:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:47:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:47:46,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:46,491 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:46,491 INFO L424 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:46,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:46,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1440079378, now seen corresponding path program 132 times [2018-10-15 12:47:46,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:46,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:46,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:47:46,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:47:46,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:47:46,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1318, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:47:46,949 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 41 states. [2018-10-15 12:47:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:48,090 INFO L93 Difference]: Finished difference Result 973 states and 994 transitions. [2018-10-15 12:47:48,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 12:47:48,090 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2018-10-15 12:47:48,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:48,091 INFO L225 Difference]: With dead ends: 973 [2018-10-15 12:47:48,091 INFO L226 Difference]: Without dead ends: 967 [2018-10-15 12:47:48,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1682, Invalid=5974, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 12:47:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-10-15 12:47:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 326. [2018-10-15 12:47:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:47:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:47:48,096 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 12:47:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:48,097 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:47:48,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:47:48,097 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:47:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:47:48,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:48,097 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:48,097 INFO L424 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:48,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1422695091, now seen corresponding path program 133 times [2018-10-15 12:47:48,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 623 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:48,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:48,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:47:48,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:47:48,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:47:48,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=1446, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:47:48,591 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 43 states. [2018-10-15 12:47:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:49,793 INFO L93 Difference]: Finished difference Result 968 states and 989 transitions. [2018-10-15 12:47:49,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 12:47:49,793 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 154 [2018-10-15 12:47:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:49,795 INFO L225 Difference]: With dead ends: 968 [2018-10-15 12:47:49,795 INFO L226 Difference]: Without dead ends: 962 [2018-10-15 12:47:49,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1940, Invalid=6990, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:47:49,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-10-15 12:47:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 326. [2018-10-15 12:47:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:47:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:47:49,800 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 12:47:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:49,800 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:47:49,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:47:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:47:49,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:47:49,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:49,801 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:49,801 INFO L424 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:49,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:49,802 INFO L82 PathProgramCache]: Analyzing trace with hash -963898772, now seen corresponding path program 134 times [2018-10-15 12:47:49,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:50,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:50,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:47:50,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:47:50,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:47:50,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1568, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:47:50,341 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 45 states. [2018-10-15 12:47:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:52,038 INFO L93 Difference]: Finished difference Result 914 states and 935 transitions. [2018-10-15 12:47:52,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 12:47:52,038 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 154 [2018-10-15 12:47:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:52,040 INFO L225 Difference]: With dead ends: 914 [2018-10-15 12:47:52,040 INFO L226 Difference]: Without dead ends: 908 [2018-10-15 12:47:52,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2127 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2262, Invalid=8040, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 12:47:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-10-15 12:47:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 326. [2018-10-15 12:47:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:47:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:47:52,044 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 12:47:52,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:52,045 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:47:52,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:47:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:47:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:47:52,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:52,045 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:52,046 INFO L424 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:52,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash -286320309, now seen corresponding path program 135 times [2018-10-15 12:47:52,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 987 backedges. 0 proven. 987 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:52,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:52,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:47:52,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:47:52,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:47:52,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1684, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:47:52,617 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 47 states. [2018-10-15 12:47:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:54,335 INFO L93 Difference]: Finished difference Result 788 states and 809 transitions. [2018-10-15 12:47:54,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 12:47:54,335 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 154 [2018-10-15 12:47:54,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:54,336 INFO L225 Difference]: With dead ends: 788 [2018-10-15 12:47:54,336 INFO L226 Difference]: Without dead ends: 782 [2018-10-15 12:47:54,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2427 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2648, Invalid=9124, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:47:54,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-10-15 12:47:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 326. [2018-10-15 12:47:54,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:47:54,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:47:54,341 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 12:47:54,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:54,341 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:47:54,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:47:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:47:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 12:47:54,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:54,342 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:54,342 INFO L424 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:54,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:54,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1676760946, now seen corresponding path program 136 times [2018-10-15 12:47:54,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 0 proven. 857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:54,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:54,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:47:54,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:47:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:47:54,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1033, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:47:54,992 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 37 states. [2018-10-15 12:47:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:55,905 INFO L93 Difference]: Finished difference Result 707 states and 728 transitions. [2018-10-15 12:47:55,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 12:47:55,906 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-10-15 12:47:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:55,907 INFO L225 Difference]: With dead ends: 707 [2018-10-15 12:47:55,907 INFO L226 Difference]: Without dead ends: 701 [2018-10-15 12:47:55,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1383, Invalid=3873, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:47:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-10-15 12:47:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 326. [2018-10-15 12:47:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:47:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:47:55,911 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 157 [2018-10-15 12:47:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:55,912 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:47:55,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:47:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:47:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 12:47:55,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:55,912 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:55,912 INFO L424 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:55,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:55,913 INFO L82 PathProgramCache]: Analyzing trace with hash 452362867, now seen corresponding path program 137 times [2018-10-15 12:47:55,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:56,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:56,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:47:56,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:47:56,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:47:56,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1178, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:47:56,551 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 39 states. [2018-10-15 12:47:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:57,551 INFO L93 Difference]: Finished difference Result 869 states and 890 transitions. [2018-10-15 12:47:57,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 12:47:57,552 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 157 [2018-10-15 12:47:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:57,553 INFO L225 Difference]: With dead ends: 869 [2018-10-15 12:47:57,553 INFO L226 Difference]: Without dead ends: 863 [2018-10-15 12:47:57,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1492, Invalid=4828, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 12:47:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-10-15 12:47:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 326. [2018-10-15 12:47:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:47:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:47:57,558 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 157 [2018-10-15 12:47:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:57,558 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:47:57,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:47:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:47:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 12:47:57,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:57,559 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:57,559 INFO L424 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:57,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:57,559 INFO L82 PathProgramCache]: Analyzing trace with hash -825418828, now seen corresponding path program 138 times [2018-10-15 12:47:57,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:58,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:58,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:47:58,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:47:58,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:47:58,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1317, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:47:58,041 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 41 states. [2018-10-15 12:47:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:59,158 INFO L93 Difference]: Finished difference Result 959 states and 980 transitions. [2018-10-15 12:47:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 12:47:59,159 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 157 [2018-10-15 12:47:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:59,160 INFO L225 Difference]: With dead ends: 959 [2018-10-15 12:47:59,160 INFO L226 Difference]: Without dead ends: 953 [2018-10-15 12:47:59,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1665, Invalid=5817, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:47:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-10-15 12:47:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 326. [2018-10-15 12:47:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:47:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:47:59,164 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 157 [2018-10-15 12:47:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:59,165 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:47:59,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:47:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:47:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 12:47:59,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:59,165 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:59,165 INFO L424 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:59,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash -943705291, now seen corresponding path program 139 times [2018-10-15 12:47:59,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 0 proven. 620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:59,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:59,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:47:59,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:47:59,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:47:59,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1450, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:47:59,638 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 43 states. [2018-10-15 12:48:00,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:00,854 INFO L93 Difference]: Finished difference Result 977 states and 998 transitions. [2018-10-15 12:48:00,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 12:48:00,855 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 157 [2018-10-15 12:48:00,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:00,856 INFO L225 Difference]: With dead ends: 977 [2018-10-15 12:48:00,856 INFO L226 Difference]: Without dead ends: 971 [2018-10-15 12:48:00,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1902, Invalid=6840, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 12:48:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-10-15 12:48:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 326. [2018-10-15 12:48:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:48:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:48:00,862 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 157 [2018-10-15 12:48:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:00,862 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:48:00,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:48:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:48:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 12:48:00,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:00,863 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:00,863 INFO L424 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:00,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash 633264374, now seen corresponding path program 140 times [2018-10-15 12:48:00,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 0 proven. 721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:01,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:01,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:48:01,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:48:01,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:48:01,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1577, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:48:01,627 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 45 states. [2018-10-15 12:48:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:03,097 INFO L93 Difference]: Finished difference Result 954 states and 975 transitions. [2018-10-15 12:48:03,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 12:48:03,098 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 157 [2018-10-15 12:48:03,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:03,099 INFO L225 Difference]: With dead ends: 954 [2018-10-15 12:48:03,099 INFO L226 Difference]: Without dead ends: 948 [2018-10-15 12:48:03,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2093 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2203, Invalid=7897, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:48:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2018-10-15 12:48:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 326. [2018-10-15 12:48:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:48:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:48:03,104 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 157 [2018-10-15 12:48:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:03,104 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:48:03,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:48:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:48:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 12:48:03,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:03,105 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:03,105 INFO L424 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:03,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:03,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1096555767, now seen corresponding path program 141 times [2018-10-15 12:48:03,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:03,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:03,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:48:03,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:48:03,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:48:03,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1698, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:48:03,816 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 47 states. [2018-10-15 12:48:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:05,366 INFO L93 Difference]: Finished difference Result 864 states and 885 transitions. [2018-10-15 12:48:05,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 12:48:05,367 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 157 [2018-10-15 12:48:05,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:05,368 INFO L225 Difference]: With dead ends: 864 [2018-10-15 12:48:05,368 INFO L226 Difference]: Without dead ends: 858 [2018-10-15 12:48:05,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2387 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2568, Invalid=8988, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 12:48:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-10-15 12:48:05,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 326. [2018-10-15 12:48:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:48:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 12:48:05,372 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 157 [2018-10-15 12:48:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:05,372 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 12:48:05,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:48:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 12:48:05,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 12:48:05,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:05,373 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:05,373 INFO L424 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:05,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:05,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1288638264, now seen corresponding path program 142 times [2018-10-15 12:48:05,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 0 proven. 1193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:06,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:06,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:48:06,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:48:06,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:48:06,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=1813, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:48:06,026 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 49 states. [2018-10-15 12:48:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:08,053 INFO L93 Difference]: Finished difference Result 711 states and 733 transitions. [2018-10-15 12:48:08,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 12:48:08,053 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 157 [2018-10-15 12:48:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:08,054 INFO L225 Difference]: With dead ends: 711 [2018-10-15 12:48:08,054 INFO L226 Difference]: Without dead ends: 705 [2018-10-15 12:48:08,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2708 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2997, Invalid=10113, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:48:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-10-15 12:48:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 332. [2018-10-15 12:48:08,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 12:48:08,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 12:48:08,059 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 157 [2018-10-15 12:48:08,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:08,059 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 12:48:08,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:48:08,059 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 12:48:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:48:08,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:08,060 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:08,060 INFO L424 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:08,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:08,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1193293914, now seen corresponding path program 143 times [2018-10-15 12:48:08,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 0 proven. 977 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:08,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:08,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:48:08,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:48:08,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:48:08,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:48:08,525 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 37 states. [2018-10-15 12:48:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:09,355 INFO L93 Difference]: Finished difference Result 609 states and 631 transitions. [2018-10-15 12:48:09,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:48:09,356 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 160 [2018-10-15 12:48:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:09,357 INFO L225 Difference]: With dead ends: 609 [2018-10-15 12:48:09,357 INFO L226 Difference]: Without dead ends: 603 [2018-10-15 12:48:09,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1416, Invalid=3696, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 12:48:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-15 12:48:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 332. [2018-10-15 12:48:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 12:48:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 12:48:09,360 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 12:48:09,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:09,361 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 12:48:09,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:48:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 12:48:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:48:09,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:09,362 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:09,362 INFO L424 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:09,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:09,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1640263109, now seen corresponding path program 144 times [2018-10-15 12:48:09,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 0 proven. 772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:09,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:09,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:48:09,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:48:09,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:48:09,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:48:09,815 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 39 states. [2018-10-15 12:48:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:10,685 INFO L93 Difference]: Finished difference Result 807 states and 829 transitions. [2018-10-15 12:48:10,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:48:10,686 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 160 [2018-10-15 12:48:10,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:10,687 INFO L225 Difference]: With dead ends: 807 [2018-10-15 12:48:10,687 INFO L226 Difference]: Without dead ends: 801 [2018-10-15 12:48:10,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1504, Invalid=4658, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:48:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-15 12:48:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 332. [2018-10-15 12:48:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 12:48:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 12:48:10,691 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 12:48:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:10,691 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 12:48:10,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:48:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 12:48:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:48:10,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:10,692 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:10,692 INFO L424 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:10,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1980781148, now seen corresponding path program 145 times [2018-10-15 12:48:10,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:11,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:11,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:48:11,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:48:11,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:48:11,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:48:11,137 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 41 states. [2018-10-15 12:48:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:12,323 INFO L93 Difference]: Finished difference Result 933 states and 955 transitions. [2018-10-15 12:48:12,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:48:12,324 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 160 [2018-10-15 12:48:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:12,325 INFO L225 Difference]: With dead ends: 933 [2018-10-15 12:48:12,325 INFO L226 Difference]: Without dead ends: 927 [2018-10-15 12:48:12,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1656, Invalid=5654, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 12:48:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-10-15 12:48:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 332. [2018-10-15 12:48:12,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 12:48:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 12:48:12,329 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 12:48:12,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:12,329 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 12:48:12,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:48:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 12:48:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:48:12,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:12,330 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:12,330 INFO L424 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:12,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:12,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1534560445, now seen corresponding path program 146 times [2018-10-15 12:48:12,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:12,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:12,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:48:12,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:48:12,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:48:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:48:12,848 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 43 states. [2018-10-15 12:48:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:14,030 INFO L93 Difference]: Finished difference Result 987 states and 1009 transitions. [2018-10-15 12:48:14,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:48:14,031 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 160 [2018-10-15 12:48:14,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:14,032 INFO L225 Difference]: With dead ends: 987 [2018-10-15 12:48:14,032 INFO L226 Difference]: Without dead ends: 981 [2018-10-15 12:48:14,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1797 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1872, Invalid=6684, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:48:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-10-15 12:48:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 332. [2018-10-15 12:48:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 12:48:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 12:48:14,036 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 12:48:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:14,037 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 12:48:14,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:48:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 12:48:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:48:14,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:14,037 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:14,038 INFO L424 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:14,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1517176158, now seen corresponding path program 147 times [2018-10-15 12:48:14,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:14,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:14,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:48:14,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:48:14,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:48:14,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1584, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:48:14,561 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 45 states. [2018-10-15 12:48:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:15,863 INFO L93 Difference]: Finished difference Result 982 states and 1004 transitions. [2018-10-15 12:48:15,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:48:15,864 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 160 [2018-10-15 12:48:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:15,865 INFO L225 Difference]: With dead ends: 982 [2018-10-15 12:48:15,865 INFO L226 Difference]: Without dead ends: 976 [2018-10-15 12:48:15,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2152, Invalid=7748, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 12:48:15,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-10-15 12:48:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 332. [2018-10-15 12:48:15,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 12:48:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 12:48:15,869 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 12:48:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:15,869 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 12:48:15,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:48:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 12:48:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:48:15,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:15,870 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:15,870 INFO L424 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:15,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:15,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1058379839, now seen corresponding path program 148 times [2018-10-15 12:48:15,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:16,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:16,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:48:16,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:48:16,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:48:16,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:48:16,471 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 47 states. [2018-10-15 12:48:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:18,077 INFO L93 Difference]: Finished difference Result 928 states and 950 transitions. [2018-10-15 12:48:18,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:48:18,078 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 160 [2018-10-15 12:48:18,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:18,079 INFO L225 Difference]: With dead ends: 928 [2018-10-15 12:48:18,079 INFO L226 Difference]: Without dead ends: 922 [2018-10-15 12:48:18,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2349 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2496, Invalid=8846, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:48:18,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2018-10-15 12:48:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 332. [2018-10-15 12:48:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 12:48:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 12:48:18,085 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 12:48:18,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:18,085 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 12:48:18,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:48:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 12:48:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:48:18,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:18,086 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:18,086 INFO L424 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:18,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:18,087 INFO L82 PathProgramCache]: Analyzing trace with hash -380801376, now seen corresponding path program 149 times [2018-10-15 12:48:18,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 0 proven. 1097 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:18,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:18,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:48:18,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:48:18,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:48:18,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=1830, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:48:18,764 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 49 states. [2018-10-15 12:48:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:20,538 INFO L93 Difference]: Finished difference Result 802 states and 824 transitions. [2018-10-15 12:48:20,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:48:20,538 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 160 [2018-10-15 12:48:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:20,539 INFO L225 Difference]: With dead ends: 802 [2018-10-15 12:48:20,540 INFO L226 Difference]: Without dead ends: 796 [2018-10-15 12:48:20,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2904, Invalid=9978, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 12:48:20,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-10-15 12:48:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 332. [2018-10-15 12:48:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 12:48:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 12:48:20,544 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 12:48:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:20,544 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 12:48:20,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:48:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 12:48:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:48:20,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:20,545 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:20,545 INFO L424 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:20,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:20,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1077757636, now seen corresponding path program 16 times [2018-10-15 12:48:20,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 0 proven. 1112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:20,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:20,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:48:20,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:48:20,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:48:20,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:48:20,945 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 37 states. [2018-10-15 12:48:21,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:21,796 INFO L93 Difference]: Finished difference Result 490 states and 512 transitions. [2018-10-15 12:48:21,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 12:48:21,796 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 163 [2018-10-15 12:48:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:21,797 INFO L225 Difference]: With dead ends: 490 [2018-10-15 12:48:21,797 INFO L226 Difference]: Without dead ends: 484 [2018-10-15 12:48:21,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1457, Invalid=3513, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:48:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-15 12:48:21,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 344. [2018-10-15 12:48:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 12:48:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 12:48:21,802 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 12:48:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:21,802 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 12:48:21,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:48:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 12:48:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:48:21,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:21,803 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:21,803 INFO L424 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:21,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash 194872829, now seen corresponding path program 150 times [2018-10-15 12:48:21,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 0 proven. 871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:22,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:22,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:48:22,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:48:22,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:48:22,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1160, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:48:22,291 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 39 states. [2018-10-15 12:48:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:23,231 INFO L93 Difference]: Finished difference Result 847 states and 869 transitions. [2018-10-15 12:48:23,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 12:48:23,241 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 163 [2018-10-15 12:48:23,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:23,242 INFO L225 Difference]: With dead ends: 847 [2018-10-15 12:48:23,242 INFO L226 Difference]: Without dead ends: 841 [2018-10-15 12:48:23,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1524, Invalid=4482, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 12:48:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-10-15 12:48:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 344. [2018-10-15 12:48:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 12:48:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 12:48:23,246 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 12:48:23,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:23,247 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 12:48:23,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:48:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 12:48:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:48:23,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:23,248 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:23,248 INFO L424 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:23,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:23,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1029525250, now seen corresponding path program 151 times [2018-10-15 12:48:23,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:23,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:23,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:48:23,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:48:23,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:48:23,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:48:23,716 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 41 states. [2018-10-15 12:48:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:24,714 INFO L93 Difference]: Finished difference Result 991 states and 1013 transitions. [2018-10-15 12:48:24,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 12:48:24,714 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 163 [2018-10-15 12:48:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:24,716 INFO L225 Difference]: With dead ends: 991 [2018-10-15 12:48:24,716 INFO L226 Difference]: Without dead ends: 985 [2018-10-15 12:48:24,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1655, Invalid=5485, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:48:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2018-10-15 12:48:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 344. [2018-10-15 12:48:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 12:48:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 12:48:24,721 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 12:48:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:24,721 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 12:48:24,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:48:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 12:48:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:48:24,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:24,722 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:24,722 INFO L424 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:24,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:24,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1987660351, now seen corresponding path program 152 times [2018-10-15 12:48:24,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 0 proven. 659 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:25,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:25,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:48:25,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:48:25,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:48:25,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:48:25,201 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 43 states. [2018-10-15 12:48:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:26,302 INFO L93 Difference]: Finished difference Result 1063 states and 1085 transitions. [2018-10-15 12:48:26,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 12:48:26,302 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 163 [2018-10-15 12:48:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:26,303 INFO L225 Difference]: With dead ends: 1063 [2018-10-15 12:48:26,304 INFO L226 Difference]: Without dead ends: 1057 [2018-10-15 12:48:26,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1850, Invalid=6522, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 12:48:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-10-15 12:48:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 344. [2018-10-15 12:48:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 12:48:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 12:48:26,308 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 12:48:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:26,308 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 12:48:26,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:48:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 12:48:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:48:26,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:26,309 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:26,309 INFO L424 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:26,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:26,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1869373888, now seen corresponding path program 153 times [2018-10-15 12:48:26,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:27,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:27,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:48:27,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:48:27,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:48:27,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:48:27,024 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 45 states. [2018-10-15 12:48:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:28,267 INFO L93 Difference]: Finished difference Result 1067 states and 1089 transitions. [2018-10-15 12:48:28,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 12:48:28,268 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 163 [2018-10-15 12:48:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:28,269 INFO L225 Difference]: With dead ends: 1067 [2018-10-15 12:48:28,269 INFO L226 Difference]: Without dead ends: 1061 [2018-10-15 12:48:28,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2031 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2109, Invalid=7593, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:48:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2018-10-15 12:48:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 344. [2018-10-15 12:48:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 12:48:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 12:48:28,274 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 12:48:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:28,274 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 12:48:28,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:48:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 12:48:28,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:48:28,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:28,275 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:28,276 INFO L424 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:28,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:28,276 INFO L82 PathProgramCache]: Analyzing trace with hash -848623743, now seen corresponding path program 154 times [2018-10-15 12:48:28,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 0 proven. 807 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:28,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:28,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:48:28,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:48:28,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:48:28,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1720, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:48:28,856 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 47 states. [2018-10-15 12:48:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:30,363 INFO L93 Difference]: Finished difference Result 1031 states and 1053 transitions. [2018-10-15 12:48:30,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 12:48:30,364 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 163 [2018-10-15 12:48:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:30,365 INFO L225 Difference]: With dead ends: 1031 [2018-10-15 12:48:30,365 INFO L226 Difference]: Without dead ends: 1025 [2018-10-15 12:48:30,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2313 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2432, Invalid=8698, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 12:48:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-10-15 12:48:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 344. [2018-10-15 12:48:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 12:48:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 12:48:30,370 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 12:48:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:30,370 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 12:48:30,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:48:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 12:48:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:48:30,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:30,372 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:30,372 INFO L424 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:30,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:30,372 INFO L82 PathProgramCache]: Analyzing trace with hash -385332350, now seen corresponding path program 155 times [2018-10-15 12:48:30,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 0 proven. 1016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:31,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:31,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:48:31,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:48:31,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:48:31,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1845, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:48:31,033 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 49 states. [2018-10-15 12:48:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:32,956 INFO L93 Difference]: Finished difference Result 923 states and 945 transitions. [2018-10-15 12:48:32,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 12:48:32,957 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 163 [2018-10-15 12:48:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:32,958 INFO L225 Difference]: With dead ends: 923 [2018-10-15 12:48:32,958 INFO L226 Difference]: Without dead ends: 917 [2018-10-15 12:48:32,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2819, Invalid=9837, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:48:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-10-15 12:48:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 344. [2018-10-15 12:48:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 12:48:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 12:48:32,963 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 12:48:32,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:32,963 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 12:48:32,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:48:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 12:48:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:48:32,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:32,964 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:32,964 INFO L424 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:32,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:32,964 INFO L82 PathProgramCache]: Analyzing trace with hash -193249853, now seen corresponding path program 156 times [2018-10-15 12:48:32,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1315 backedges. 0 proven. 1315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:33,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:33,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:48:33,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:48:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:48:33,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=1964, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:48:33,665 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 51 states. [2018-10-15 12:48:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:35,682 INFO L93 Difference]: Finished difference Result 752 states and 775 transitions. [2018-10-15 12:48:35,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 12:48:35,682 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 163 [2018-10-15 12:48:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:35,683 INFO L225 Difference]: With dead ends: 752 [2018-10-15 12:48:35,683 INFO L226 Difference]: Without dead ends: 746 [2018-10-15 12:48:35,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3270, Invalid=11010, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 12:48:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-10-15 12:48:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 350. [2018-10-15 12:48:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:35,687 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 163 [2018-10-15 12:48:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:35,687 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:35,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:48:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 12:48:35,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:35,688 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:35,688 INFO L424 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:35,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:35,688 INFO L82 PathProgramCache]: Analyzing trace with hash -153351877, now seen corresponding path program 157 times [2018-10-15 12:48:35,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 0 proven. 985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:36,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:36,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:48:36,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:48:36,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:48:36,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1148, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:48:36,130 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 39 states. [2018-10-15 12:48:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:37,180 INFO L93 Difference]: Finished difference Result 758 states and 781 transitions. [2018-10-15 12:48:37,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 12:48:37,180 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 166 [2018-10-15 12:48:37,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:37,181 INFO L225 Difference]: With dead ends: 758 [2018-10-15 12:48:37,181 INFO L226 Difference]: Without dead ends: 752 [2018-10-15 12:48:37,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1552, Invalid=4300, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:48:37,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-10-15 12:48:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 350. [2018-10-15 12:48:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:37,184 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 12:48:37,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:37,184 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:37,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:48:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 12:48:37,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:37,185 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:37,185 INFO L424 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:37,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:37,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1614762150, now seen corresponding path program 158 times [2018-10-15 12:48:37,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 0 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:37,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:37,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:48:37,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:48:37,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:48:37,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1302, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:48:37,837 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 41 states. [2018-10-15 12:48:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:38,851 INFO L93 Difference]: Finished difference Result 938 states and 961 transitions. [2018-10-15 12:48:38,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 12:48:38,852 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 166 [2018-10-15 12:48:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:38,853 INFO L225 Difference]: With dead ends: 938 [2018-10-15 12:48:38,853 INFO L226 Difference]: Without dead ends: 932 [2018-10-15 12:48:38,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1662, Invalid=5310, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 12:48:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2018-10-15 12:48:38,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 350. [2018-10-15 12:48:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:38,857 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 12:48:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:38,857 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:38,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:48:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 12:48:38,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:38,858 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:38,858 INFO L424 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:38,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:38,858 INFO L82 PathProgramCache]: Analyzing trace with hash -940839111, now seen corresponding path program 159 times [2018-10-15 12:48:38,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 0 proven. 701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:39,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:39,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:48:39,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:48:39,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:48:39,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1450, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:48:39,349 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 43 states. [2018-10-15 12:48:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:40,457 INFO L93 Difference]: Finished difference Result 1046 states and 1069 transitions. [2018-10-15 12:48:40,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 12:48:40,458 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 166 [2018-10-15 12:48:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:40,459 INFO L225 Difference]: With dead ends: 1046 [2018-10-15 12:48:40,459 INFO L226 Difference]: Without dead ends: 1040 [2018-10-15 12:48:40,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1836, Invalid=6354, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:48:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-10-15 12:48:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 350. [2018-10-15 12:48:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:40,463 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 12:48:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:40,464 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:40,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:48:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 12:48:40,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:40,465 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:40,465 INFO L424 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:40,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:40,465 INFO L82 PathProgramCache]: Analyzing trace with hash -494618408, now seen corresponding path program 160 times [2018-10-15 12:48:40,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:40,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:40,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:48:40,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:48:40,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:48:40,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=1592, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:48:40,995 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 45 states. [2018-10-15 12:48:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:42,467 INFO L93 Difference]: Finished difference Result 1082 states and 1105 transitions. [2018-10-15 12:48:42,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 12:48:42,468 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 166 [2018-10-15 12:48:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:42,469 INFO L225 Difference]: With dead ends: 1082 [2018-10-15 12:48:42,469 INFO L226 Difference]: Without dead ends: 1076 [2018-10-15 12:48:42,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2074, Invalid=7432, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 12:48:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2018-10-15 12:48:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 350. [2018-10-15 12:48:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:42,474 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 12:48:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:42,474 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:42,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:48:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 12:48:42,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:42,475 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:42,475 INFO L424 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:42,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:42,475 INFO L82 PathProgramCache]: Analyzing trace with hash -477234121, now seen corresponding path program 161 times [2018-10-15 12:48:42,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 0 proven. 777 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:43,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:43,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:48:43,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:48:43,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:48:43,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=1728, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:48:43,121 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 47 states. [2018-10-15 12:48:44,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:44,582 INFO L93 Difference]: Finished difference Result 1068 states and 1091 transitions. [2018-10-15 12:48:44,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 12:48:44,582 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 166 [2018-10-15 12:48:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:44,583 INFO L225 Difference]: With dead ends: 1068 [2018-10-15 12:48:44,583 INFO L226 Difference]: Without dead ends: 1062 [2018-10-15 12:48:44,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2279 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2376, Invalid=8544, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:48:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-10-15 12:48:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 350. [2018-10-15 12:48:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:44,589 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 12:48:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:44,590 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:44,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:48:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 12:48:44,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:44,591 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:44,591 INFO L424 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:44,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:44,591 INFO L82 PathProgramCache]: Analyzing trace with hash -18437802, now seen corresponding path program 162 times [2018-10-15 12:48:44,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:45,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:45,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:48:45,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:48:45,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:48:45,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=1858, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:48:45,237 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 49 states. [2018-10-15 12:48:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:46,868 INFO L93 Difference]: Finished difference Result 996 states and 1019 transitions. [2018-10-15 12:48:46,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 12:48:46,868 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 166 [2018-10-15 12:48:46,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:46,869 INFO L225 Difference]: With dead ends: 996 [2018-10-15 12:48:46,869 INFO L226 Difference]: Without dead ends: 990 [2018-10-15 12:48:46,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2582 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2742, Invalid=9690, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 12:48:46,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-10-15 12:48:46,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 350. [2018-10-15 12:48:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:46,875 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 12:48:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:46,875 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:46,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:48:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:46,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 12:48:46,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:46,876 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:46,876 INFO L424 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:46,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:46,877 INFO L82 PathProgramCache]: Analyzing trace with hash 659140661, now seen corresponding path program 163 times [2018-10-15 12:48:46,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 0 proven. 1213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:47,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:47,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:48:47,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:48:47,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:48:47,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=1982, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:48:47,900 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 51 states. [2018-10-15 12:48:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:49,738 INFO L93 Difference]: Finished difference Result 852 states and 875 transitions. [2018-10-15 12:48:49,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 12:48:49,738 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 166 [2018-10-15 12:48:49,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:49,739 INFO L225 Difference]: With dead ends: 852 [2018-10-15 12:48:49,739 INFO L226 Difference]: Without dead ends: 846 [2018-10-15 12:48:49,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2912 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3172, Invalid=10870, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:48:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-10-15 12:48:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 350. [2018-10-15 12:48:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:49,744 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 12:48:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:49,744 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:49,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:48:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:48:49,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:49,745 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:49,745 INFO L424 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:49,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash 236360583, now seen corresponding path program 164 times [2018-10-15 12:48:49,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 0 proven. 1114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:50,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:50,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:48:50,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:48:50,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:48:50,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1134, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:48:50,170 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 39 states. [2018-10-15 12:48:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:51,070 INFO L93 Difference]: Finished difference Result 645 states and 668 transitions. [2018-10-15 12:48:51,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:48:51,071 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 169 [2018-10-15 12:48:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:51,072 INFO L225 Difference]: With dead ends: 645 [2018-10-15 12:48:51,072 INFO L226 Difference]: Without dead ends: 639 [2018-10-15 12:48:51,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1588, Invalid=4112, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 12:48:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-15 12:48:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 350. [2018-10-15 12:48:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:51,076 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 12:48:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:51,076 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:51,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:48:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:48:51,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:51,077 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:51,077 INFO L424 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:51,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1508991048, now seen corresponding path program 165 times [2018-10-15 12:48:51,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 0 proven. 891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:51,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:51,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:48:51,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:48:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:48:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:48:51,538 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 41 states. [2018-10-15 12:48:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:52,630 INFO L93 Difference]: Finished difference Result 861 states and 884 transitions. [2018-10-15 12:48:52,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:48:52,630 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 169 [2018-10-15 12:48:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:52,631 INFO L225 Difference]: With dead ends: 861 [2018-10-15 12:48:52,631 INFO L226 Difference]: Without dead ends: 855 [2018-10-15 12:48:52,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1677, Invalid=5129, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:48:52,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-10-15 12:48:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 350. [2018-10-15 12:48:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:52,634 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 12:48:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:52,634 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:52,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:48:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:48:52,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:52,635 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:52,635 INFO L424 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:52,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:52,635 INFO L82 PathProgramCache]: Analyzing trace with hash 284592969, now seen corresponding path program 166 times [2018-10-15 12:48:52,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:53,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:53,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:48:53,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:48:53,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:48:53,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=1446, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:48:53,163 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 43 states. [2018-10-15 12:48:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:54,260 INFO L93 Difference]: Finished difference Result 1005 states and 1028 transitions. [2018-10-15 12:48:54,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:48:54,260 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 169 [2018-10-15 12:48:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:54,261 INFO L225 Difference]: With dead ends: 1005 [2018-10-15 12:48:54,261 INFO L226 Difference]: Without dead ends: 999 [2018-10-15 12:48:54,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=6180, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:48:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-10-15 12:48:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 350. [2018-10-15 12:48:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:54,266 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 12:48:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:54,266 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:54,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:48:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:48:54,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:54,267 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:54,267 INFO L424 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:54,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:54,267 INFO L82 PathProgramCache]: Analyzing trace with hash -993188726, now seen corresponding path program 167 times [2018-10-15 12:48:54,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:54,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:54,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:48:54,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:48:54,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:48:54,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1593, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:48:54,799 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 45 states. [2018-10-15 12:48:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:56,053 INFO L93 Difference]: Finished difference Result 1077 states and 1100 transitions. [2018-10-15 12:48:56,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:48:56,054 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 169 [2018-10-15 12:48:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:56,055 INFO L225 Difference]: With dead ends: 1077 [2018-10-15 12:48:56,055 INFO L226 Difference]: Without dead ends: 1071 [2018-10-15 12:48:56,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2047, Invalid=7265, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:48:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-10-15 12:48:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 350. [2018-10-15 12:48:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:56,060 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 12:48:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:56,060 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:56,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:48:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:48:56,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:56,061 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:56,061 INFO L424 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:56,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:56,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1111475189, now seen corresponding path program 168 times [2018-10-15 12:48:56,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 0 proven. 762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:56,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:56,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:48:56,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:48:56,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:48:56,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=1734, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:48:56,656 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 47 states. [2018-10-15 12:48:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:58,275 INFO L93 Difference]: Finished difference Result 1081 states and 1104 transitions. [2018-10-15 12:48:58,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:48:58,276 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 169 [2018-10-15 12:48:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:58,277 INFO L225 Difference]: With dead ends: 1081 [2018-10-15 12:48:58,277 INFO L226 Difference]: Without dead ends: 1075 [2018-10-15 12:48:58,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2247 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2328, Invalid=8384, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 12:48:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2018-10-15 12:48:58,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 350. [2018-10-15 12:48:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:48:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:48:58,282 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 12:48:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:58,282 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:48:58,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:48:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:48:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:48:58,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:58,283 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:58,283 INFO L424 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:58,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:58,283 INFO L82 PathProgramCache]: Analyzing trace with hash 465494476, now seen corresponding path program 169 times [2018-10-15 12:48:58,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 0 proven. 899 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:58,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:58,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:48:58,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:48:58,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:48:58,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1869, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:48:58,930 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 49 states. [2018-10-15 12:49:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:00,563 INFO L93 Difference]: Finished difference Result 1045 states and 1068 transitions. [2018-10-15 12:49:00,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:49:00,563 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 169 [2018-10-15 12:49:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:00,565 INFO L225 Difference]: With dead ends: 1045 [2018-10-15 12:49:00,565 INFO L226 Difference]: Without dead ends: 1039 [2018-10-15 12:49:00,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2544 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2673, Invalid=9537, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:49:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2018-10-15 12:49:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 350. [2018-10-15 12:49:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:49:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:49:00,569 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 12:49:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:00,569 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:49:00,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:49:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:49:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:49:00,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:00,570 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:00,570 INFO L424 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:00,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash 928785869, now seen corresponding path program 170 times [2018-10-15 12:49:00,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 0 proven. 1126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:01,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:01,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:49:01,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:49:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:49:01,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1998, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:49:01,244 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 51 states. [2018-10-15 12:49:03,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:03,325 INFO L93 Difference]: Finished difference Result 937 states and 960 transitions. [2018-10-15 12:49:03,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:49:03,325 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 169 [2018-10-15 12:49:03,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:03,326 INFO L225 Difference]: With dead ends: 937 [2018-10-15 12:49:03,326 INFO L226 Difference]: Without dead ends: 931 [2018-10-15 12:49:03,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2868 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3082, Invalid=10724, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 12:49:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2018-10-15 12:49:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 350. [2018-10-15 12:49:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:49:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 12:49:03,331 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 12:49:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:03,331 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 12:49:03,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:49:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 12:49:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:49:03,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:03,332 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:03,332 INFO L424 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:03,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1120868366, now seen corresponding path program 171 times [2018-10-15 12:49:03,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1443 backedges. 0 proven. 1443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:04,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:04,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:49:04,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:49:04,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:49:04,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=2121, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:49:04,084 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 53 states. [2018-10-15 12:49:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:06,186 INFO L93 Difference]: Finished difference Result 766 states and 790 transitions. [2018-10-15 12:49:06,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:49:06,186 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 169 [2018-10-15 12:49:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:06,187 INFO L225 Difference]: With dead ends: 766 [2018-10-15 12:49:06,187 INFO L226 Difference]: Without dead ends: 760 [2018-10-15 12:49:06,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3219 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3555, Invalid=11945, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 12:49:06,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-10-15 12:49:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 356. [2018-10-15 12:49:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-15 12:49:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 380 transitions. [2018-10-15 12:49:06,193 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 380 transitions. Word has length 169 [2018-10-15 12:49:06,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:06,194 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 380 transitions. [2018-10-15 12:49:06,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:49:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 380 transitions. [2018-10-15 12:49:06,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:49:06,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:06,195 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:06,195 INFO L424 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:06,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:06,195 INFO L82 PathProgramCache]: Analyzing trace with hash -335869263, now seen corresponding path program 17 times [2018-10-15 12:49:06,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 0 proven. 1258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:06,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:06,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:49:06,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:49:06,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:49:06,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1118, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:49:06,679 INFO L87 Difference]: Start difference. First operand 356 states and 380 transitions. Second operand 39 states. [2018-10-15 12:49:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:07,596 INFO L93 Difference]: Finished difference Result 523 states and 547 transitions. [2018-10-15 12:49:07,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 12:49:07,597 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 172 [2018-10-15 12:49:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:07,597 INFO L225 Difference]: With dead ends: 523 [2018-10-15 12:49:07,598 INFO L226 Difference]: Without dead ends: 517 [2018-10-15 12:49:07,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1632, Invalid=3918, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:49:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-10-15 12:49:07,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 368. [2018-10-15 12:49:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:07,601 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 12:49:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:07,602 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:07,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:49:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:49:07,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:07,603 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:07,603 INFO L424 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:07,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:07,603 INFO L82 PathProgramCache]: Analyzing trace with hash 115607312, now seen corresponding path program 172 times [2018-10-15 12:49:07,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 0 proven. 999 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:08,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:08,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:49:08,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:49:08,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:49:08,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1282, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:49:08,285 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 41 states. [2018-10-15 12:49:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:09,267 INFO L93 Difference]: Finished difference Result 907 states and 931 transitions. [2018-10-15 12:49:09,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 12:49:09,268 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 172 [2018-10-15 12:49:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:09,269 INFO L225 Difference]: With dead ends: 907 [2018-10-15 12:49:09,269 INFO L226 Difference]: Without dead ends: 901 [2018-10-15 12:49:09,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1700, Invalid=4942, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 12:49:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-10-15 12:49:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 368. [2018-10-15 12:49:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:09,273 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 12:49:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:09,274 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:09,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:49:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:49:09,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:09,274 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:09,274 INFO L424 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:09,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:09,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1345802961, now seen corresponding path program 173 times [2018-10-15 12:49:09,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:09,796 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:09,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:09,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:49:09,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:49:09,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:49:09,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1440, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:49:09,798 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 43 states. [2018-10-15 12:49:10,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:10,870 INFO L93 Difference]: Finished difference Result 1069 states and 1093 transitions. [2018-10-15 12:49:10,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 12:49:10,870 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 172 [2018-10-15 12:49:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:10,871 INFO L225 Difference]: With dead ends: 1069 [2018-10-15 12:49:10,871 INFO L226 Difference]: Without dead ends: 1063 [2018-10-15 12:49:10,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1832, Invalid=6000, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:49:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-10-15 12:49:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 368. [2018-10-15 12:49:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:10,877 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 12:49:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:10,877 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:10,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:49:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:49:10,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:10,879 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:10,879 INFO L424 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:10,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash -671879922, now seen corresponding path program 174 times [2018-10-15 12:49:10,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:11,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:11,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:49:11,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:49:11,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:49:11,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=1592, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:49:11,449 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 45 states. [2018-10-15 12:49:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:12,665 INFO L93 Difference]: Finished difference Result 1159 states and 1183 transitions. [2018-10-15 12:49:12,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 12:49:12,666 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2018-10-15 12:49:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:12,667 INFO L225 Difference]: With dead ends: 1159 [2018-10-15 12:49:12,667 INFO L226 Difference]: Without dead ends: 1153 [2018-10-15 12:49:12,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1927 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2028, Invalid=7092, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 12:49:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-10-15 12:49:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 368. [2018-10-15 12:49:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:12,672 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 12:49:12,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:12,673 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:12,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:49:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:49:12,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:12,673 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:12,673 INFO L424 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:12,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:12,674 INFO L82 PathProgramCache]: Analyzing trace with hash -225659219, now seen corresponding path program 175 times [2018-10-15 12:49:12,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 0 proven. 762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:13,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:13,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:49:13,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:49:13,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:49:13,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1738, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:49:13,516 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 47 states. [2018-10-15 12:49:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:14,850 INFO L93 Difference]: Finished difference Result 1177 states and 1201 transitions. [2018-10-15 12:49:14,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 12:49:14,850 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 172 [2018-10-15 12:49:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:14,851 INFO L225 Difference]: With dead ends: 1177 [2018-10-15 12:49:14,851 INFO L226 Difference]: Without dead ends: 1171 [2018-10-15 12:49:14,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2217 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2288, Invalid=8218, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:49:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2018-10-15 12:49:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 368. [2018-10-15 12:49:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:14,856 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 12:49:14,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:14,856 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:14,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:49:14,856 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:49:14,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:14,857 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:14,857 INFO L424 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:14,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:14,857 INFO L82 PathProgramCache]: Analyzing trace with hash -208274932, now seen corresponding path program 176 times [2018-10-15 12:49:14,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:15,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:15,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:49:15,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:49:15,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:49:15,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=1878, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:49:15,500 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 49 states. [2018-10-15 12:49:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:17,091 INFO L93 Difference]: Finished difference Result 1154 states and 1178 transitions. [2018-10-15 12:49:17,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 12:49:17,092 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 172 [2018-10-15 12:49:17,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:17,093 INFO L225 Difference]: With dead ends: 1154 [2018-10-15 12:49:17,093 INFO L226 Difference]: Without dead ends: 1148 [2018-10-15 12:49:17,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2508 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2612, Invalid=9378, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 12:49:17,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2018-10-15 12:49:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 368. [2018-10-15 12:49:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:17,098 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 12:49:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:17,098 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:17,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:49:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:49:17,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:17,099 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:17,099 INFO L424 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:17,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash 250521387, now seen corresponding path program 177 times [2018-10-15 12:49:17,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 0 proven. 1054 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:17,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:17,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:49:17,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:49:17,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:49:17,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=2012, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:49:17,804 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 51 states. [2018-10-15 12:49:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:19,792 INFO L93 Difference]: Finished difference Result 1064 states and 1088 transitions. [2018-10-15 12:49:19,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 12:49:19,793 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 172 [2018-10-15 12:49:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:19,794 INFO L225 Difference]: With dead ends: 1064 [2018-10-15 12:49:19,794 INFO L226 Difference]: Without dead ends: 1058 [2018-10-15 12:49:19,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2826 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3000, Invalid=10572, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:49:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2018-10-15 12:49:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 368. [2018-10-15 12:49:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:19,799 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 12:49:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:19,799 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:19,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:49:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:49:19,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:19,800 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:19,800 INFO L424 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:19,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:19,801 INFO L82 PathProgramCache]: Analyzing trace with hash 928099850, now seen corresponding path program 178 times [2018-10-15 12:49:19,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:20,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:20,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:49:20,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:49:20,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:49:20,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=2140, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:49:20,533 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 53 states. [2018-10-15 12:49:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:22,631 INFO L93 Difference]: Finished difference Result 902 states and 926 transitions. [2018-10-15 12:49:22,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 12:49:22,631 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 172 [2018-10-15 12:49:22,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:22,632 INFO L225 Difference]: With dead ends: 902 [2018-10-15 12:49:22,632 INFO L226 Difference]: Without dead ends: 896 [2018-10-15 12:49:22,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3171 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3452, Invalid=11800, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 12:49:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2018-10-15 12:49:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 368. [2018-10-15 12:49:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:22,637 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 12:49:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:22,637 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:22,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:49:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 12:49:22,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:22,638 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:22,638 INFO L424 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:22,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:22,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1609414254, now seen corresponding path program 179 times [2018-10-15 12:49:22,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:23,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:23,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:49:23,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:49:23,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:49:23,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:49:23,350 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 41 states. [2018-10-15 12:49:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:24,340 INFO L93 Difference]: Finished difference Result 803 states and 827 transitions. [2018-10-15 12:49:24,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 12:49:24,340 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 175 [2018-10-15 12:49:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:24,341 INFO L225 Difference]: With dead ends: 803 [2018-10-15 12:49:24,341 INFO L226 Difference]: Without dead ends: 797 [2018-10-15 12:49:24,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1731, Invalid=4749, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:49:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-10-15 12:49:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 368. [2018-10-15 12:49:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:24,346 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 12:49:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:24,346 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:24,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:49:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 12:49:24,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:24,347 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:24,347 INFO L424 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:24,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash -336783789, now seen corresponding path program 180 times [2018-10-15 12:49:24,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 0 proven. 917 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:24,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:24,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:49:24,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:49:24,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:49:24,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:49:24,857 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 43 states. [2018-10-15 12:49:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:25,936 INFO L93 Difference]: Finished difference Result 1001 states and 1025 transitions. [2018-10-15 12:49:25,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 12:49:25,936 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 175 [2018-10-15 12:49:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:25,937 INFO L225 Difference]: With dead ends: 1001 [2018-10-15 12:49:25,937 INFO L226 Difference]: Without dead ends: 995 [2018-10-15 12:49:25,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1842, Invalid=5814, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 12:49:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2018-10-15 12:49:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 368. [2018-10-15 12:49:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:25,942 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 12:49:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:25,942 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:25,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:49:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:25,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 12:49:25,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:25,943 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:25,943 INFO L424 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:25,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:25,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1561181868, now seen corresponding path program 181 times [2018-10-15 12:49:25,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 0 proven. 802 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:26,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:26,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:49:26,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:49:26,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:49:26,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:49:26,576 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 45 states. [2018-10-15 12:49:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:27,810 INFO L93 Difference]: Finished difference Result 1127 states and 1151 transitions. [2018-10-15 12:49:27,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 12:49:27,810 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 175 [2018-10-15 12:49:27,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:27,812 INFO L225 Difference]: With dead ends: 1127 [2018-10-15 12:49:27,812 INFO L226 Difference]: Without dead ends: 1121 [2018-10-15 12:49:27,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2017, Invalid=6913, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:49:27,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-10-15 12:49:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 368. [2018-10-15 12:49:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:27,817 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 12:49:27,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:27,817 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:27,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:49:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 12:49:27,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:27,818 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:27,818 INFO L424 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:27,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1456003733, now seen corresponding path program 182 times [2018-10-15 12:49:27,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 0 proven. 777 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:28,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:28,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:49:28,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:49:28,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:49:28,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1740, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:49:28,626 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 47 states. [2018-10-15 12:49:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:30,004 INFO L93 Difference]: Finished difference Result 1181 states and 1205 transitions. [2018-10-15 12:49:30,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 12:49:30,005 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 175 [2018-10-15 12:49:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:30,006 INFO L225 Difference]: With dead ends: 1181 [2018-10-15 12:49:30,006 INFO L226 Difference]: Without dead ends: 1175 [2018-10-15 12:49:30,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2256, Invalid=8046, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 12:49:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-10-15 12:49:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 368. [2018-10-15 12:49:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:30,012 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 12:49:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:30,012 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:30,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:49:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 12:49:30,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:30,013 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:30,013 INFO L424 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:30,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1337717270, now seen corresponding path program 183 times [2018-10-15 12:49:30,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 0 proven. 842 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:30,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:30,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:49:30,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:49:30,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:49:30,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1885, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:49:30,693 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 49 states. [2018-10-15 12:49:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:32,206 INFO L93 Difference]: Finished difference Result 1176 states and 1200 transitions. [2018-10-15 12:49:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 12:49:32,207 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 175 [2018-10-15 12:49:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:32,208 INFO L225 Difference]: With dead ends: 1176 [2018-10-15 12:49:32,208 INFO L226 Difference]: Without dead ends: 1170 [2018-10-15 12:49:32,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2559, Invalid=9213, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:49:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-10-15 12:49:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 368. [2018-10-15 12:49:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:32,213 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 12:49:32,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:32,213 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:32,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:49:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 12:49:32,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:32,214 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:32,214 INFO L424 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:32,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1380280361, now seen corresponding path program 184 times [2018-10-15 12:49:32,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 997 backedges. 0 proven. 997 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:32,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:32,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:49:32,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:49:32,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:49:32,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=2024, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:49:32,892 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 51 states. [2018-10-15 12:49:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:34,864 INFO L93 Difference]: Finished difference Result 1122 states and 1146 transitions. [2018-10-15 12:49:34,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 12:49:34,865 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 175 [2018-10-15 12:49:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:34,866 INFO L225 Difference]: With dead ends: 1122 [2018-10-15 12:49:34,866 INFO L226 Difference]: Without dead ends: 1116 [2018-10-15 12:49:34,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2926, Invalid=10414, Unknown=0, NotChecked=0, Total=13340 [2018-10-15 12:49:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2018-10-15 12:49:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 368. [2018-10-15 12:49:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:34,871 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 12:49:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:34,871 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:34,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:49:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 12:49:34,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:34,872 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:34,872 INFO L424 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:34,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:34,873 INFO L82 PathProgramCache]: Analyzing trace with hash -916988968, now seen corresponding path program 185 times [2018-10-15 12:49:34,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 1242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:35,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:35,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:49:35,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:49:35,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:49:35,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=2157, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:49:35,625 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 53 states. [2018-10-15 12:49:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:37,645 INFO L93 Difference]: Finished difference Result 996 states and 1020 transitions. [2018-10-15 12:49:37,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 12:49:37,646 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 175 [2018-10-15 12:49:37,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:37,647 INFO L225 Difference]: With dead ends: 996 [2018-10-15 12:49:37,647 INFO L226 Difference]: Without dead ends: 990 [2018-10-15 12:49:37,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3125 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3357, Invalid=11649, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:49:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-10-15 12:49:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 368. [2018-10-15 12:49:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 12:49:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 12:49:37,652 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 12:49:37,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:37,652 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 12:49:37,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:49:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 12:49:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 12:49:37,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:37,653 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:37,653 INFO L424 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:37,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash -724906471, now seen corresponding path program 186 times [2018-10-15 12:49:37,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 1577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:38,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:38,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:49:38,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:49:38,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:49:38,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=686, Invalid=2284, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:49:38,612 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 55 states. [2018-10-15 12:49:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:40,941 INFO L93 Difference]: Finished difference Result 807 states and 832 transitions. [2018-10-15 12:49:40,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 12:49:40,941 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 175 [2018-10-15 12:49:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:40,942 INFO L225 Difference]: With dead ends: 807 [2018-10-15 12:49:40,942 INFO L226 Difference]: Without dead ends: 801 [2018-10-15 12:49:40,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3491 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3852, Invalid=12918, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 12:49:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-15 12:49:40,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 374. [2018-10-15 12:49:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:49:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 12:49:40,948 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 175 [2018-10-15 12:49:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:40,948 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 12:49:40,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:49:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 12:49:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:49:40,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:40,949 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:40,949 INFO L424 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:40,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:40,949 INFO L82 PathProgramCache]: Analyzing trace with hash 652252358, now seen corresponding path program 187 times [2018-10-15 12:49:40,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:41,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:41,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:49:41,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:49:41,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:49:41,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1254, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:49:41,488 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 41 states. [2018-10-15 12:49:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:42,395 INFO L93 Difference]: Finished difference Result 687 states and 712 transitions. [2018-10-15 12:49:42,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:49:42,396 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 178 [2018-10-15 12:49:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:42,397 INFO L225 Difference]: With dead ends: 687 [2018-10-15 12:49:42,397 INFO L226 Difference]: Without dead ends: 681 [2018-10-15 12:49:42,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=4550, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 12:49:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-10-15 12:49:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 374. [2018-10-15 12:49:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:49:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 12:49:42,401 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 12:49:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:42,401 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 12:49:42,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:49:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 12:49:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:49:42,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:42,402 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:42,402 INFO L424 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:42,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1103728933, now seen corresponding path program 188 times [2018-10-15 12:49:42,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 0 proven. 1019 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:42,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:42,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:49:42,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:49:42,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:49:42,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1422, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:49:42,909 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 43 states. [2018-10-15 12:49:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:44,178 INFO L93 Difference]: Finished difference Result 921 states and 946 transitions. [2018-10-15 12:49:44,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:49:44,178 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 178 [2018-10-15 12:49:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:44,179 INFO L225 Difference]: With dead ends: 921 [2018-10-15 12:49:44,179 INFO L226 Difference]: Without dead ends: 915 [2018-10-15 12:49:44,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1860, Invalid=5622, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:49:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-10-15 12:49:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 374. [2018-10-15 12:49:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:49:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 12:49:44,185 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 12:49:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:44,185 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 12:49:44,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:49:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 12:49:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:49:44,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:44,186 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:44,186 INFO L424 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:44,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:44,186 INFO L82 PathProgramCache]: Analyzing trace with hash -357681340, now seen corresponding path program 189 times [2018-10-15 12:49:44,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:44,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:44,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:49:44,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:49:44,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:49:44,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1584, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:49:44,725 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 45 states. [2018-10-15 12:49:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:45,898 INFO L93 Difference]: Finished difference Result 1083 states and 1108 transitions. [2018-10-15 12:49:45,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:49:45,898 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 178 [2018-10-15 12:49:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:45,899 INFO L225 Difference]: With dead ends: 1083 [2018-10-15 12:49:45,899 INFO L226 Difference]: Without dead ends: 1077 [2018-10-15 12:49:45,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1827 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2014, Invalid=6728, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 12:49:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2018-10-15 12:49:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 374. [2018-10-15 12:49:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:49:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 12:49:45,904 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 12:49:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:45,904 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 12:49:45,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:49:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 12:49:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:49:45,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:45,905 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:45,905 INFO L424 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:45,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:45,906 INFO L82 PathProgramCache]: Analyzing trace with hash 316241699, now seen corresponding path program 190 times [2018-10-15 12:49:45,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 0 proven. 807 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:46,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:46,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:49:46,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:49:46,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:49:46,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1740, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:49:46,487 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 47 states. [2018-10-15 12:49:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:47,783 INFO L93 Difference]: Finished difference Result 1173 states and 1198 transitions. [2018-10-15 12:49:47,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:49:47,783 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 178 [2018-10-15 12:49:47,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:47,785 INFO L225 Difference]: With dead ends: 1173 [2018-10-15 12:49:47,785 INFO L226 Difference]: Without dead ends: 1167 [2018-10-15 12:49:47,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2232, Invalid=7868, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:49:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-10-15 12:49:47,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 374. [2018-10-15 12:49:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:49:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 12:49:47,790 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 12:49:47,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:47,790 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 12:49:47,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:49:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 12:49:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:49:47,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:47,791 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:47,791 INFO L424 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:47,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:47,791 INFO L82 PathProgramCache]: Analyzing trace with hash 762462402, now seen corresponding path program 191 times [2018-10-15 12:49:47,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:48,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:48,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:49:48,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:49:48,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:49:48,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:49:48,402 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 49 states. [2018-10-15 12:49:50,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:50,025 INFO L93 Difference]: Finished difference Result 1191 states and 1216 transitions. [2018-10-15 12:49:50,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:49:50,025 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 178 [2018-10-15 12:49:50,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:50,026 INFO L225 Difference]: With dead ends: 1191 [2018-10-15 12:49:50,026 INFO L226 Difference]: Without dead ends: 1185 [2018-10-15 12:49:50,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2442 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2514, Invalid=9042, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 12:49:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2018-10-15 12:49:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 374. [2018-10-15 12:49:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:49:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 12:49:50,031 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 12:49:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:50,032 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 12:49:50,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:49:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 12:49:50,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:49:50,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:50,032 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:50,033 INFO L424 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:50,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:50,033 INFO L82 PathProgramCache]: Analyzing trace with hash 779846689, now seen corresponding path program 192 times [2018-10-15 12:49:50,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 0 proven. 955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:50,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:50,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:49:50,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:49:50,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:49:50,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2034, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:49:50,698 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 51 states. [2018-10-15 12:49:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:52,404 INFO L93 Difference]: Finished difference Result 1168 states and 1193 transitions. [2018-10-15 12:49:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:49:52,404 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 178 [2018-10-15 12:49:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:52,405 INFO L225 Difference]: With dead ends: 1168 [2018-10-15 12:49:52,405 INFO L226 Difference]: Without dead ends: 1162 [2018-10-15 12:49:52,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2748 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2860, Invalid=10250, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:49:52,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-10-15 12:49:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 374. [2018-10-15 12:49:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:49:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 12:49:52,410 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 12:49:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:52,410 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 12:49:52,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:49:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 12:49:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:49:52,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:52,411 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:52,411 INFO L424 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:52,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:52,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1238643008, now seen corresponding path program 193 times [2018-10-15 12:49:52,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 1164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:53,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:53,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:49:53,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:49:53,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:49:53,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=584, Invalid=2172, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:49:53,324 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 53 states. [2018-10-15 12:49:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:55,453 INFO L93 Difference]: Finished difference Result 1078 states and 1103 transitions. [2018-10-15 12:49:55,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:49:55,454 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 178 [2018-10-15 12:49:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:55,455 INFO L225 Difference]: With dead ends: 1078 [2018-10-15 12:49:55,455 INFO L226 Difference]: Without dead ends: 1072 [2018-10-15 12:49:55,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3270, Invalid=11492, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 12:49:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2018-10-15 12:49:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 374. [2018-10-15 12:49:55,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:49:55,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 12:49:55,460 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 12:49:55,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:55,460 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 12:49:55,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:49:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 12:49:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:49:55,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:55,461 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:55,461 INFO L424 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:55,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1916221471, now seen corresponding path program 194 times [2018-10-15 12:49:55,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 0 proven. 1463 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:56,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:56,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:49:56,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:49:56,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:49:56,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=2304, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:49:56,261 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 55 states. [2018-10-15 12:49:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:58,521 INFO L93 Difference]: Finished difference Result 916 states and 941 transitions. [2018-10-15 12:49:58,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:49:58,521 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 178 [2018-10-15 12:49:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:58,522 INFO L225 Difference]: With dead ends: 916 [2018-10-15 12:49:58,522 INFO L226 Difference]: Without dead ends: 910 [2018-10-15 12:49:58,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3441 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3744, Invalid=12768, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 12:49:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-10-15 12:49:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 374. [2018-10-15 12:49:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:49:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 12:49:58,528 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 12:49:58,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:58,528 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 12:49:58,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:49:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 12:49:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:49:58,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:58,529 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:58,529 INFO L424 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:58,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:58,529 INFO L82 PathProgramCache]: Analyzing trace with hash -518091556, now seen corresponding path program 18 times [2018-10-15 12:49:58,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1413 backedges. 0 proven. 1413 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:59,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:59,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:49:59,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:49:59,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:49:59,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1237, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:49:59,227 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 41 states. [2018-10-15 12:50:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:00,191 INFO L93 Difference]: Finished difference Result 550 states and 575 transitions. [2018-10-15 12:50:00,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 12:50:00,192 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 181 [2018-10-15 12:50:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:00,193 INFO L225 Difference]: With dead ends: 550 [2018-10-15 12:50:00,193 INFO L226 Difference]: Without dead ends: 544 [2018-10-15 12:50:00,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1817, Invalid=4345, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:50:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-10-15 12:50:00,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 386. [2018-10-15 12:50:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 12:50:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 12:50:00,197 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 12:50:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:00,197 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 12:50:00,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:50:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 12:50:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:50:00,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:00,198 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:00,198 INFO L424 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:00,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:00,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2110917469, now seen corresponding path program 195 times [2018-10-15 12:50:00,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 0 proven. 1136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:00,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:00,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:50:00,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:50:00,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:50:00,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1410, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:50:00,718 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 43 states. [2018-10-15 12:50:01,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:01,866 INFO L93 Difference]: Finished difference Result 961 states and 986 transitions. [2018-10-15 12:50:01,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 12:50:01,866 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 181 [2018-10-15 12:50:01,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:01,867 INFO L225 Difference]: With dead ends: 961 [2018-10-15 12:50:01,867 INFO L226 Difference]: Without dead ends: 955 [2018-10-15 12:50:01,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1886, Invalid=5424, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 12:50:01,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-10-15 12:50:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 386. [2018-10-15 12:50:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 12:50:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 12:50:01,872 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 12:50:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:01,872 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 12:50:01,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:50:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 12:50:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:50:01,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:01,873 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:01,873 INFO L424 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:01,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:01,873 INFO L82 PathProgramCache]: Analyzing trace with hash -911419362, now seen corresponding path program 196 times [2018-10-15 12:50:01,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 0 proven. 949 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:02,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:02,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:50:02,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:50:02,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:50:02,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1577, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:50:02,457 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 45 states. [2018-10-15 12:50:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:03,632 INFO L93 Difference]: Finished difference Result 1141 states and 1166 transitions. [2018-10-15 12:50:03,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 12:50:03,633 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 181 [2018-10-15 12:50:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:03,634 INFO L225 Difference]: With dead ends: 1141 [2018-10-15 12:50:03,634 INFO L226 Difference]: Without dead ends: 1135 [2018-10-15 12:50:03,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2019, Invalid=6537, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:50:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2018-10-15 12:50:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 386. [2018-10-15 12:50:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 12:50:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 12:50:03,639 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 12:50:03,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:03,639 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 12:50:03,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:50:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 12:50:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:50:03,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:03,640 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:03,640 INFO L424 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:03,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2135817441, now seen corresponding path program 197 times [2018-10-15 12:50:03,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:04,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:04,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:50:04,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:50:04,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:50:04,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1738, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:50:04,441 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 47 states. [2018-10-15 12:50:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:05,749 INFO L93 Difference]: Finished difference Result 1249 states and 1274 transitions. [2018-10-15 12:50:05,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 12:50:05,749 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 181 [2018-10-15 12:50:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:05,750 INFO L225 Difference]: With dead ends: 1249 [2018-10-15 12:50:05,750 INFO L226 Difference]: Without dead ends: 1243 [2018-10-15 12:50:05,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2099 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2216, Invalid=7684, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 12:50:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2018-10-15 12:50:05,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 386. [2018-10-15 12:50:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 12:50:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 12:50:05,756 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 12:50:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:05,756 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 12:50:05,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:50:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 12:50:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:50:05,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:05,757 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:05,757 INFO L424 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:05,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:05,757 INFO L82 PathProgramCache]: Analyzing trace with hash 881368160, now seen corresponding path program 198 times [2018-10-15 12:50:05,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 0 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:06,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:06,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:50:06,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:50:06,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:50:06,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=1893, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:50:06,377 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 49 states. [2018-10-15 12:50:07,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:07,885 INFO L93 Difference]: Finished difference Result 1285 states and 1310 transitions. [2018-10-15 12:50:07,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 12:50:07,886 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 181 [2018-10-15 12:50:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:07,887 INFO L225 Difference]: With dead ends: 1285 [2018-10-15 12:50:07,887 INFO L226 Difference]: Without dead ends: 1279 [2018-10-15 12:50:07,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2410 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2477, Invalid=8865, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:50:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-10-15 12:50:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 386. [2018-10-15 12:50:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 12:50:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 12:50:07,892 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 12:50:07,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:07,892 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 12:50:07,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:50:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 12:50:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:50:07,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:07,893 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:07,893 INFO L424 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:07,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:07,894 INFO L82 PathProgramCache]: Analyzing trace with hash 763081697, now seen corresponding path program 199 times [2018-10-15 12:50:07,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:08,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:08,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:50:08,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:50:08,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:50:08,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=2042, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:50:08,578 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 51 states. [2018-10-15 12:50:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:10,466 INFO L93 Difference]: Finished difference Result 1271 states and 1296 transitions. [2018-10-15 12:50:10,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 12:50:10,466 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 181 [2018-10-15 12:50:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:10,467 INFO L225 Difference]: With dead ends: 1271 [2018-10-15 12:50:10,467 INFO L226 Difference]: Without dead ends: 1265 [2018-10-15 12:50:10,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2712 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2802, Invalid=10080, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 12:50:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-10-15 12:50:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 386. [2018-10-15 12:50:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 12:50:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 12:50:10,472 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 12:50:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:10,472 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 12:50:10,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:50:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 12:50:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:50:10,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:10,473 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:10,473 INFO L424 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:10,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1954915934, now seen corresponding path program 200 times [2018-10-15 12:50:10,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 0 proven. 1101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:11,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:11,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:50:11,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:50:11,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:50:11,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=2185, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:50:11,223 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 53 states. [2018-10-15 12:50:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:13,137 INFO L93 Difference]: Finished difference Result 1199 states and 1224 transitions. [2018-10-15 12:50:13,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 12:50:13,137 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 181 [2018-10-15 12:50:13,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:13,138 INFO L225 Difference]: With dead ends: 1199 [2018-10-15 12:50:13,138 INFO L226 Difference]: Without dead ends: 1193 [2018-10-15 12:50:13,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3039 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3191, Invalid=11329, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 12:50:13,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2018-10-15 12:50:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 386. [2018-10-15 12:50:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 12:50:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 12:50:13,142 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 12:50:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:13,143 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 12:50:13,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:50:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 12:50:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:50:13,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:13,143 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:13,144 INFO L424 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:13,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:13,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1491624541, now seen corresponding path program 201 times [2018-10-15 12:50:13,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 1364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:13,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:13,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:50:13,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:50:13,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:50:13,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=2322, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:50:13,940 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 55 states. [2018-10-15 12:50:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:16,275 INFO L93 Difference]: Finished difference Result 1055 states and 1080 transitions. [2018-10-15 12:50:16,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 12:50:16,276 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 181 [2018-10-15 12:50:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:16,277 INFO L225 Difference]: With dead ends: 1055 [2018-10-15 12:50:16,277 INFO L226 Difference]: Without dead ends: 1049 [2018-10-15 12:50:16,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3393 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3644, Invalid=12612, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 12:50:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-10-15 12:50:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 386. [2018-10-15 12:50:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 12:50:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 12:50:16,281 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 12:50:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:16,281 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 12:50:16,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:50:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 12:50:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:50:16,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:16,282 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:16,282 INFO L424 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:16,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:16,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1299542044, now seen corresponding path program 202 times [2018-10-15 12:50:16,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:17,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:17,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:50:17,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:50:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:50:17,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=2453, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:50:17,139 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 57 states. [2018-10-15 12:50:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:19,784 INFO L93 Difference]: Finished difference Result 848 states and 874 transitions. [2018-10-15 12:50:19,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 12:50:19,785 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 181 [2018-10-15 12:50:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:19,786 INFO L225 Difference]: With dead ends: 848 [2018-10-15 12:50:19,786 INFO L226 Difference]: Without dead ends: 842 [2018-10-15 12:50:19,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3774 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4161, Invalid=13929, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:50:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-10-15 12:50:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 392. [2018-10-15 12:50:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:19,790 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 181 [2018-10-15 12:50:19,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:19,790 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:19,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:50:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:50:19,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:19,792 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:19,792 INFO L424 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:19,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:19,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1423538971, now seen corresponding path program 203 times [2018-10-15 12:50:19,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 0 proven. 1268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:20,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:20,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:50:20,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:50:20,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:50:20,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:50:20,320 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 43 states. [2018-10-15 12:50:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:21,356 INFO L93 Difference]: Finished difference Result 854 states and 880 transitions. [2018-10-15 12:50:21,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 12:50:21,356 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 184 [2018-10-15 12:50:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:21,358 INFO L225 Difference]: With dead ends: 854 [2018-10-15 12:50:21,358 INFO L226 Difference]: Without dead ends: 848 [2018-10-15 12:50:21,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1920, Invalid=5220, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:50:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-10-15 12:50:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 392. [2018-10-15 12:50:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:21,368 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 12:50:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:21,369 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:21,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:50:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:50:21,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:21,370 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:21,370 INFO L424 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:21,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:21,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1875015546, now seen corresponding path program 204 times [2018-10-15 12:50:21,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 1045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:21,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:21,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:50:21,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:50:21,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:50:21,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1568, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:50:21,931 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 45 states. [2018-10-15 12:50:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:23,107 INFO L93 Difference]: Finished difference Result 1070 states and 1096 transitions. [2018-10-15 12:50:23,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 12:50:23,108 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 184 [2018-10-15 12:50:23,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:23,109 INFO L225 Difference]: With dead ends: 1070 [2018-10-15 12:50:23,109 INFO L226 Difference]: Without dead ends: 1064 [2018-10-15 12:50:23,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2032, Invalid=6340, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 12:50:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2018-10-15 12:50:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 392. [2018-10-15 12:50:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:23,114 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 12:50:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:23,114 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:23,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:50:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:50:23,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:23,115 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:23,116 INFO L424 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:23,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash 413605273, now seen corresponding path program 205 times [2018-10-15 12:50:23,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:23,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:23,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:50:23,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:50:23,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:50:23,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=1734, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:50:23,728 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 47 states. [2018-10-15 12:50:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:25,189 INFO L93 Difference]: Finished difference Result 1214 states and 1240 transitions. [2018-10-15 12:50:25,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 12:50:25,190 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 184 [2018-10-15 12:50:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:25,191 INFO L225 Difference]: With dead ends: 1214 [2018-10-15 12:50:25,191 INFO L226 Difference]: Without dead ends: 1208 [2018-10-15 12:50:25,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2047 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2208, Invalid=7494, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:50:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2018-10-15 12:50:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 392. [2018-10-15 12:50:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:25,196 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 12:50:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:25,196 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:25,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:50:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:50:25,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:25,197 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:25,197 INFO L424 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:25,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:25,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1087528312, now seen corresponding path program 206 times [2018-10-15 12:50:25,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 0 proven. 869 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:25,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:25,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:50:25,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:50:25,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:50:25,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=1894, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:50:25,821 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 49 states. [2018-10-15 12:50:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:27,223 INFO L93 Difference]: Finished difference Result 1286 states and 1312 transitions. [2018-10-15 12:50:27,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 12:50:27,223 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-10-15 12:50:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:27,224 INFO L225 Difference]: With dead ends: 1286 [2018-10-15 12:50:27,225 INFO L226 Difference]: Without dead ends: 1280 [2018-10-15 12:50:27,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2372 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2448, Invalid=8682, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 12:50:27,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2018-10-15 12:50:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 392. [2018-10-15 12:50:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:27,237 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 12:50:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:27,237 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:27,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:50:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:50:27,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:27,238 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:27,239 INFO L424 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:27,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:27,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1533749015, now seen corresponding path program 207 times [2018-10-15 12:50:27,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 0 proven. 916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:27,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:27,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:50:27,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:50:27,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:50:27,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=2048, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:50:27,965 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 51 states. [2018-10-15 12:50:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:29,555 INFO L93 Difference]: Finished difference Result 1290 states and 1316 transitions. [2018-10-15 12:50:29,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 12:50:29,556 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 184 [2018-10-15 12:50:29,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:29,557 INFO L225 Difference]: With dead ends: 1290 [2018-10-15 12:50:29,557 INFO L226 Difference]: Without dead ends: 1284 [2018-10-15 12:50:29,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2678 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2752, Invalid=9904, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:50:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2018-10-15 12:50:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 392. [2018-10-15 12:50:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:29,563 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 12:50:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:29,564 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:29,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:50:29,564 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:50:29,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:29,565 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:29,565 INFO L424 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:29,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:29,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1551133302, now seen corresponding path program 208 times [2018-10-15 12:50:29,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:30,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:30,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:50:30,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:50:30,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:50:30,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=2196, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:50:30,528 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 53 states. [2018-10-15 12:50:32,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:32,337 INFO L93 Difference]: Finished difference Result 1254 states and 1280 transitions. [2018-10-15 12:50:32,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 12:50:32,338 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 184 [2018-10-15 12:50:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:32,339 INFO L225 Difference]: With dead ends: 1254 [2018-10-15 12:50:32,339 INFO L226 Difference]: Without dead ends: 1248 [2018-10-15 12:50:32,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2999 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3120, Invalid=11160, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 12:50:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2018-10-15 12:50:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 392. [2018-10-15 12:50:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:32,344 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 12:50:32,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:32,345 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:32,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:50:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:50:32,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:32,345 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:32,346 INFO L424 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:32,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:32,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2009929621, now seen corresponding path program 209 times [2018-10-15 12:50:32,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 0 proven. 1280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:33,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:33,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:50:33,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:50:33,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:50:33,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2338, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:50:33,155 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 55 states. [2018-10-15 12:50:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:35,532 INFO L93 Difference]: Finished difference Result 1146 states and 1172 transitions. [2018-10-15 12:50:35,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-15 12:50:35,532 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 184 [2018-10-15 12:50:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:35,534 INFO L225 Difference]: With dead ends: 1146 [2018-10-15 12:50:35,534 INFO L226 Difference]: Without dead ends: 1140 [2018-10-15 12:50:35,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3347 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3552, Invalid=12450, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:50:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-10-15 12:50:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 392. [2018-10-15 12:50:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:35,539 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 12:50:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:35,539 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:35,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:50:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:50:35,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:35,540 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:35,540 INFO L424 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:35,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:35,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1607459212, now seen corresponding path program 210 times [2018-10-15 12:50:35,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1597 backedges. 0 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:36,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:36,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:50:36,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:50:36,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:50:36,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=718, Invalid=2474, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:50:36,398 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 57 states. [2018-10-15 12:50:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:38,802 INFO L93 Difference]: Finished difference Result 966 states and 992 transitions. [2018-10-15 12:50:38,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-15 12:50:38,802 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 184 [2018-10-15 12:50:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:38,803 INFO L225 Difference]: With dead ends: 966 [2018-10-15 12:50:38,803 INFO L226 Difference]: Without dead ends: 960 [2018-10-15 12:50:38,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3722 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4048, Invalid=13774, Unknown=0, NotChecked=0, Total=17822 [2018-10-15 12:50:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2018-10-15 12:50:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 392. [2018-10-15 12:50:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:38,808 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 12:50:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:38,808 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:38,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:50:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 12:50:38,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:38,809 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:38,809 INFO L424 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:38,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:38,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1193637273, now seen corresponding path program 211 times [2018-10-15 12:50:38,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 0 proven. 1415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:39,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:39,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:50:39,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:50:39,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:50:39,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1380, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:50:39,331 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 43 states. [2018-10-15 12:50:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:40,550 INFO L93 Difference]: Finished difference Result 723 states and 749 transitions. [2018-10-15 12:50:40,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:50:40,550 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 187 [2018-10-15 12:50:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:40,551 INFO L225 Difference]: With dead ends: 723 [2018-10-15 12:50:40,551 INFO L226 Difference]: Without dead ends: 717 [2018-10-15 12:50:40,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1962, Invalid=5010, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 12:50:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-15 12:50:40,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 392. [2018-10-15 12:50:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:40,555 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 12:50:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:40,555 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:40,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:50:40,556 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:40,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 12:50:40,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:40,556 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:40,557 INFO L424 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:40,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:40,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1435371752, now seen corresponding path program 212 times [2018-10-15 12:50:40,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:41,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:41,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:50:41,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:50:41,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:50:41,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1557, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:50:41,102 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 45 states. [2018-10-15 12:50:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:42,239 INFO L93 Difference]: Finished difference Result 975 states and 1001 transitions. [2018-10-15 12:50:42,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:50:42,239 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 187 [2018-10-15 12:50:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:42,240 INFO L225 Difference]: With dead ends: 975 [2018-10-15 12:50:42,240 INFO L226 Difference]: Without dead ends: 969 [2018-10-15 12:50:42,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2053, Invalid=6137, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:50:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-10-15 12:50:42,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 392. [2018-10-15 12:50:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:42,245 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 12:50:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:42,245 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:42,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:50:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 12:50:42,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:42,246 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:42,246 INFO L424 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:42,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:42,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1586965079, now seen corresponding path program 213 times [2018-10-15 12:50:42,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 987 backedges. 0 proven. 987 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:42,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:42,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:50:42,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:50:42,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:50:42,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=1728, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:50:42,831 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 47 states. [2018-10-15 12:50:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:44,058 INFO L93 Difference]: Finished difference Result 1155 states and 1181 transitions. [2018-10-15 12:50:44,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:50:44,059 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 187 [2018-10-15 12:50:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:44,060 INFO L225 Difference]: With dead ends: 1155 [2018-10-15 12:50:44,060 INFO L226 Difference]: Without dead ends: 1149 [2018-10-15 12:50:44,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1989 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2208, Invalid=7298, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 12:50:44,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2018-10-15 12:50:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 392. [2018-10-15 12:50:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:44,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:44,064 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 12:50:44,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:44,065 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:44,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:50:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 12:50:44,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:44,066 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:44,066 INFO L424 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:44,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:44,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1483604138, now seen corresponding path program 214 times [2018-10-15 12:50:44,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 0 proven. 908 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:44,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:44,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:50:44,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:50:44,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:50:44,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=1893, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:50:44,728 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 49 states. [2018-10-15 12:50:46,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:46,331 INFO L93 Difference]: Finished difference Result 1263 states and 1289 transitions. [2018-10-15 12:50:46,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:50:46,331 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 187 [2018-10-15 12:50:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:46,332 INFO L225 Difference]: With dead ends: 1263 [2018-10-15 12:50:46,332 INFO L226 Difference]: Without dead ends: 1257 [2018-10-15 12:50:46,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2328 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2427, Invalid=8493, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:50:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2018-10-15 12:50:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 392. [2018-10-15 12:50:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:46,337 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 12:50:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:46,338 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:46,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:50:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 12:50:46,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:46,338 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:46,338 INFO L424 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:46,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:46,339 INFO L82 PathProgramCache]: Analyzing trace with hash 205822443, now seen corresponding path program 215 times [2018-10-15 12:50:46,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 0 proven. 919 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:47,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:47,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:50:47,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:50:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:50:47,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=2052, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:50:47,012 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 51 states. [2018-10-15 12:50:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:48,626 INFO L93 Difference]: Finished difference Result 1299 states and 1325 transitions. [2018-10-15 12:50:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:50:48,627 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 187 [2018-10-15 12:50:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:48,628 INFO L225 Difference]: With dead ends: 1299 [2018-10-15 12:50:48,628 INFO L226 Difference]: Without dead ends: 1293 [2018-10-15 12:50:48,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2710, Invalid=9722, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 12:50:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2018-10-15 12:50:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 392. [2018-10-15 12:50:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:48,634 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 12:50:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:48,634 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:48,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:50:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 12:50:48,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:48,635 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:48,635 INFO L424 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:48,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:48,635 INFO L82 PathProgramCache]: Analyzing trace with hash 87535980, now seen corresponding path program 216 times [2018-10-15 12:50:48,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:49,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:49,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:50:49,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:50:49,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:50:49,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=2205, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:50:49,363 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 53 states. [2018-10-15 12:50:51,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:51,294 INFO L93 Difference]: Finished difference Result 1285 states and 1311 transitions. [2018-10-15 12:50:51,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:50:51,295 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 187 [2018-10-15 12:50:51,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:51,296 INFO L225 Difference]: With dead ends: 1285 [2018-10-15 12:50:51,296 INFO L226 Difference]: Without dead ends: 1279 [2018-10-15 12:50:51,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2961 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3057, Invalid=10985, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:50:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-10-15 12:50:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 392. [2018-10-15 12:50:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:51,302 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 12:50:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:51,302 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:51,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:50:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 12:50:51,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:51,303 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:51,303 INFO L424 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:51,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:51,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1664505645, now seen corresponding path program 217 times [2018-10-15 12:50:51,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 0 proven. 1211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:52,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:52,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:50:52,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:50:52,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:50:52,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=2352, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:50:52,104 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 55 states. [2018-10-15 12:50:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:54,160 INFO L93 Difference]: Finished difference Result 1213 states and 1239 transitions. [2018-10-15 12:50:54,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:50:54,168 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 187 [2018-10-15 12:50:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:54,169 INFO L225 Difference]: With dead ends: 1213 [2018-10-15 12:50:54,169 INFO L226 Difference]: Without dead ends: 1207 [2018-10-15 12:50:54,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3303 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3468, Invalid=12282, Unknown=0, NotChecked=0, Total=15750 [2018-10-15 12:50:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-10-15 12:50:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 392. [2018-10-15 12:50:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:54,173 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 12:50:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:54,173 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:54,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:50:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 12:50:54,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:54,174 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:54,175 INFO L424 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:54,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:54,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2127797038, now seen corresponding path program 218 times [2018-10-15 12:50:54,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1492 backedges. 0 proven. 1492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:55,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:55,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:50:55,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:50:55,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:50:55,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2493, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:50:55,034 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 57 states. [2018-10-15 12:50:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:57,529 INFO L93 Difference]: Finished difference Result 1069 states and 1095 transitions. [2018-10-15 12:50:57,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:50:57,529 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 187 [2018-10-15 12:50:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:57,530 INFO L225 Difference]: With dead ends: 1069 [2018-10-15 12:50:57,530 INFO L226 Difference]: Without dead ends: 1063 [2018-10-15 12:50:57,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3672 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3943, Invalid=13613, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:50:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-10-15 12:50:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 392. [2018-10-15 12:50:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:50:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 12:50:57,536 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 12:50:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:57,536 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 12:50:57,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:50:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 12:50:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 12:50:57,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:57,537 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:57,537 INFO L424 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:57,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:57,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1975087761, now seen corresponding path program 219 times [2018-10-15 12:50:57,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:58,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:58,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:50:58,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:50:58,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:50:58,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=794, Invalid=2628, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:50:58,484 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 59 states. [2018-10-15 12:51:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:01,273 INFO L93 Difference]: Finished difference Result 862 states and 889 transitions. [2018-10-15 12:51:01,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:51:01,273 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 187 [2018-10-15 12:51:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:01,274 INFO L225 Difference]: With dead ends: 862 [2018-10-15 12:51:01,274 INFO L226 Difference]: Without dead ends: 856 [2018-10-15 12:51:01,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4068 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4482, Invalid=14978, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 12:51:01,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-15 12:51:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 398. [2018-10-15 12:51:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-15 12:51:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 425 transitions. [2018-10-15 12:51:01,279 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 425 transitions. Word has length 187 [2018-10-15 12:51:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:01,279 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 425 transitions. [2018-10-15 12:51:01,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:51:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 425 transitions. [2018-10-15 12:51:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:51:01,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:01,280 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:01,280 INFO L424 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:01,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:01,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1461930769, now seen corresponding path program 19 times [2018-10-15 12:51:01,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 1577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:01,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:01,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:51:01,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:51:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:51:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=1362, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:51:01,821 INFO L87 Difference]: Start difference. First operand 398 states and 425 transitions. Second operand 43 states. [2018-10-15 12:51:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:02,932 INFO L93 Difference]: Finished difference Result 583 states and 610 transitions. [2018-10-15 12:51:02,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 12:51:02,932 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 190 [2018-10-15 12:51:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:02,933 INFO L225 Difference]: With dead ends: 583 [2018-10-15 12:51:02,933 INFO L226 Difference]: Without dead ends: 577 [2018-10-15 12:51:02,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2012, Invalid=4794, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:51:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-10-15 12:51:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 410. [2018-10-15 12:51:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:02,938 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 12:51:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:02,938 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:02,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:51:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:51:02,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:02,939 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:02,939 INFO L424 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:02,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1837134416, now seen corresponding path program 220 times [2018-10-15 12:51:02,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 0 proven. 1282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:03,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:03,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:51:03,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:51:03,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:51:03,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=1544, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:51:03,510 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 45 states. [2018-10-15 12:51:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:04,627 INFO L93 Difference]: Finished difference Result 1021 states and 1048 transitions. [2018-10-15 12:51:04,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 12:51:04,628 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 190 [2018-10-15 12:51:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:04,629 INFO L225 Difference]: With dead ends: 1021 [2018-10-15 12:51:04,629 INFO L226 Difference]: Without dead ends: 1015 [2018-10-15 12:51:04,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2082, Invalid=5928, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:51:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-10-15 12:51:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 410. [2018-10-15 12:51:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:04,634 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 12:51:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:04,634 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:04,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:51:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:51:04,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:04,635 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:04,635 INFO L424 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:04,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:04,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1385657841, now seen corresponding path program 221 times [2018-10-15 12:51:04,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:05,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:05,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:51:05,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:51:05,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:51:05,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1720, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:51:05,353 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 47 states. [2018-10-15 12:51:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:06,778 INFO L93 Difference]: Finished difference Result 1219 states and 1246 transitions. [2018-10-15 12:51:06,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 12:51:06,778 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 190 [2018-10-15 12:51:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:06,779 INFO L225 Difference]: With dead ends: 1219 [2018-10-15 12:51:06,780 INFO L226 Difference]: Without dead ends: 1213 [2018-10-15 12:51:06,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1924 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2216, Invalid=7096, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:51:06,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2018-10-15 12:51:06,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 410. [2018-10-15 12:51:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:06,785 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 12:51:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:06,785 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:06,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:51:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:51:06,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:06,786 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:06,786 INFO L424 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:06,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:06,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1447899182, now seen corresponding path program 222 times [2018-10-15 12:51:06,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:07,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:07,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:51:07,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:51:07,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:51:07,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:51:07,418 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 49 states. [2018-10-15 12:51:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:08,778 INFO L93 Difference]: Finished difference Result 1345 states and 1372 transitions. [2018-10-15 12:51:08,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 12:51:08,779 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 190 [2018-10-15 12:51:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:08,780 INFO L225 Difference]: With dead ends: 1345 [2018-10-15 12:51:08,780 INFO L226 Difference]: Without dead ends: 1339 [2018-10-15 12:51:08,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2414, Invalid=8298, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 12:51:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-10-15 12:51:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 410. [2018-10-15 12:51:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:08,786 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 12:51:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:08,786 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:08,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:51:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:51:08,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:08,787 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:08,787 INFO L424 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:08,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2121822221, now seen corresponding path program 223 times [2018-10-15 12:51:08,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:09,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:09,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:51:09,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:51:09,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:51:09,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2054, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:51:09,474 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 51 states. [2018-10-15 12:51:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:11,250 INFO L93 Difference]: Finished difference Result 1399 states and 1426 transitions. [2018-10-15 12:51:11,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 12:51:11,250 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 190 [2018-10-15 12:51:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:11,251 INFO L225 Difference]: With dead ends: 1399 [2018-10-15 12:51:11,251 INFO L226 Difference]: Without dead ends: 1393 [2018-10-15 12:51:11,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2676, Invalid=9534, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:51:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2018-10-15 12:51:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 410. [2018-10-15 12:51:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:11,257 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 12:51:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:11,257 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:11,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:51:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:51:11,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:11,258 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:11,258 INFO L424 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:11,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:11,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1726924372, now seen corresponding path program 224 times [2018-10-15 12:51:11,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 1002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:11,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:11,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:51:11,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:51:11,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:51:11,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=2212, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:51:11,986 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 53 states. [2018-10-15 12:51:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:13,724 INFO L93 Difference]: Finished difference Result 1394 states and 1421 transitions. [2018-10-15 12:51:13,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 12:51:13,725 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 190 [2018-10-15 12:51:13,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:13,726 INFO L225 Difference]: With dead ends: 1394 [2018-10-15 12:51:13,726 INFO L226 Difference]: Without dead ends: 1388 [2018-10-15 12:51:13,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3002, Invalid=10804, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 12:51:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2018-10-15 12:51:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 410. [2018-10-15 12:51:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:13,732 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 12:51:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:13,733 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:13,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:51:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:51:13,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:13,734 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:13,734 INFO L424 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:13,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:13,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1709540085, now seen corresponding path program 225 times [2018-10-15 12:51:13,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 0 proven. 1157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:14,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:14,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:51:14,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:51:14,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:51:14,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=2364, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:51:14,518 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 55 states. [2018-10-15 12:51:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:16,674 INFO L93 Difference]: Finished difference Result 1340 states and 1367 transitions. [2018-10-15 12:51:16,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 12:51:16,675 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 190 [2018-10-15 12:51:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:16,676 INFO L225 Difference]: With dead ends: 1340 [2018-10-15 12:51:16,676 INFO L226 Difference]: Without dead ends: 1334 [2018-10-15 12:51:16,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3261 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3392, Invalid=12108, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 12:51:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-10-15 12:51:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 410. [2018-10-15 12:51:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:16,682 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 12:51:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:16,682 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:16,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:51:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:51:16,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:16,683 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:16,683 INFO L424 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:16,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:16,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1250743766, now seen corresponding path program 226 times [2018-10-15 12:51:16,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1402 backedges. 0 proven. 1402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:17,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:17,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:51:17,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:51:17,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:51:17,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=2510, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:51:17,542 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 57 states. [2018-10-15 12:51:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:19,845 INFO L93 Difference]: Finished difference Result 1214 states and 1241 transitions. [2018-10-15 12:51:19,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-15 12:51:19,845 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 190 [2018-10-15 12:51:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:19,847 INFO L225 Difference]: With dead ends: 1214 [2018-10-15 12:51:19,847 INFO L226 Difference]: Without dead ends: 1208 [2018-10-15 12:51:19,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3624 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3846, Invalid=13446, Unknown=0, NotChecked=0, Total=17292 [2018-10-15 12:51:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2018-10-15 12:51:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 410. [2018-10-15 12:51:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:19,853 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 12:51:19,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:19,853 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:19,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:51:19,854 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:51:19,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:19,855 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:19,855 INFO L424 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:19,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:19,855 INFO L82 PathProgramCache]: Analyzing trace with hash -573165303, now seen corresponding path program 227 times [2018-10-15 12:51:19,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1737 backedges. 0 proven. 1737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:20,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:20,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:51:20,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:51:20,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:51:20,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=2650, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:51:20,878 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 59 states. [2018-10-15 12:51:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:23,551 INFO L93 Difference]: Finished difference Result 1016 states and 1043 transitions. [2018-10-15 12:51:23,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-15 12:51:23,552 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 190 [2018-10-15 12:51:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:23,553 INFO L225 Difference]: With dead ends: 1016 [2018-10-15 12:51:23,553 INFO L226 Difference]: Without dead ends: 1010 [2018-10-15 12:51:23,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4014 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4364, Invalid=14818, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:51:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2018-10-15 12:51:23,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 410. [2018-10-15 12:51:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:23,558 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 12:51:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:23,558 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:23,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:51:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 12:51:23,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:23,559 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:23,559 INFO L424 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:23,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:23,559 INFO L82 PathProgramCache]: Analyzing trace with hash -639175758, now seen corresponding path program 228 times [2018-10-15 12:51:23,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 0 proven. 1423 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:24,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:24,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:51:24,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:51:24,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:51:24,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1529, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:51:24,129 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 45 states. [2018-10-15 12:51:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:25,314 INFO L93 Difference]: Finished difference Result 899 states and 926 transitions. [2018-10-15 12:51:25,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 12:51:25,315 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 193 [2018-10-15 12:51:25,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:25,316 INFO L225 Difference]: With dead ends: 899 [2018-10-15 12:51:25,316 INFO L226 Difference]: Without dead ends: 893 [2018-10-15 12:51:25,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2119, Invalid=5713, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:51:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-10-15 12:51:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 410. [2018-10-15 12:51:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:25,321 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 12:51:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:25,321 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:25,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:51:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:25,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 12:51:25,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:25,323 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:25,323 INFO L424 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:25,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:25,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1989833267, now seen corresponding path program 229 times [2018-10-15 12:51:25,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 0 proven. 1182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:26,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:26,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:51:26,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:51:26,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:51:26,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:51:26,092 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 47 states. [2018-10-15 12:51:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:27,383 INFO L93 Difference]: Finished difference Result 1133 states and 1160 transitions. [2018-10-15 12:51:27,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 12:51:27,383 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 193 [2018-10-15 12:51:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:27,385 INFO L225 Difference]: With dead ends: 1133 [2018-10-15 12:51:27,385 INFO L226 Difference]: Without dead ends: 1127 [2018-10-15 12:51:27,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1853 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2232, Invalid=6888, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 12:51:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2018-10-15 12:51:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 410. [2018-10-15 12:51:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:27,390 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 12:51:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:27,390 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:27,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:51:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:27,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 12:51:27,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:27,391 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:27,391 INFO L424 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:27,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:27,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1032503564, now seen corresponding path program 230 times [2018-10-15 12:51:27,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 1031 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:28,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:28,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:51:28,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:51:28,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:51:28,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1885, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:51:28,052 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 49 states. [2018-10-15 12:51:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:29,466 INFO L93 Difference]: Finished difference Result 1295 states and 1322 transitions. [2018-10-15 12:51:29,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 12:51:29,466 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 193 [2018-10-15 12:51:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:29,467 INFO L225 Difference]: With dead ends: 1295 [2018-10-15 12:51:29,468 INFO L226 Difference]: Without dead ends: 1289 [2018-10-15 12:51:29,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2220 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2409, Invalid=8097, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:51:29,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-10-15 12:51:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 410. [2018-10-15 12:51:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:29,473 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 12:51:29,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:29,473 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:29,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:51:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 12:51:29,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:29,474 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:29,474 INFO L424 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:29,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:29,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2038065653, now seen corresponding path program 231 times [2018-10-15 12:51:29,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:30,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:30,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:51:30,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:51:30,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:51:30,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2054, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:51:30,136 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 51 states. [2018-10-15 12:51:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:31,870 INFO L93 Difference]: Finished difference Result 1385 states and 1412 transitions. [2018-10-15 12:51:31,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 12:51:31,871 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 193 [2018-10-15 12:51:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:31,872 INFO L225 Difference]: With dead ends: 1385 [2018-10-15 12:51:31,872 INFO L226 Difference]: Without dead ends: 1379 [2018-10-15 12:51:31,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2566 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2650, Invalid=9340, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 12:51:31,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2018-10-15 12:51:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 410. [2018-10-15 12:51:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:31,878 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 12:51:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:31,878 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:31,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:51:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 12:51:31,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:31,879 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:31,879 INFO L424 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:31,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash 760283958, now seen corresponding path program 232 times [2018-10-15 12:51:31,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 0 proven. 999 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:32,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:32,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:51:32,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:51:32,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:51:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=2217, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:51:32,630 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 53 states. [2018-10-15 12:51:34,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:34,358 INFO L93 Difference]: Finished difference Result 1403 states and 1430 transitions. [2018-10-15 12:51:34,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 12:51:34,358 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 193 [2018-10-15 12:51:34,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:34,359 INFO L225 Difference]: With dead ends: 1403 [2018-10-15 12:51:34,360 INFO L226 Difference]: Without dead ends: 1397 [2018-10-15 12:51:34,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2891 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2955, Invalid=10617, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:51:34,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2018-10-15 12:51:34,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 410. [2018-10-15 12:51:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:34,365 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 12:51:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:34,365 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:34,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:51:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 12:51:34,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:34,366 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:34,366 INFO L424 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:34,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:34,366 INFO L82 PathProgramCache]: Analyzing trace with hash 641997495, now seen corresponding path program 233 times [2018-10-15 12:51:34,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 0 proven. 1118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:35,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:35,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:51:35,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:51:35,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:51:35,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=2374, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:51:35,173 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 55 states. [2018-10-15 12:51:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:37,360 INFO L93 Difference]: Finished difference Result 1380 states and 1407 transitions. [2018-10-15 12:51:37,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 12:51:37,361 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 193 [2018-10-15 12:51:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:37,362 INFO L225 Difference]: With dead ends: 1380 [2018-10-15 12:51:37,362 INFO L226 Difference]: Without dead ends: 1374 [2018-10-15 12:51:37,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3221 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3324, Invalid=11928, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 12:51:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2018-10-15 12:51:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 410. [2018-10-15 12:51:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:37,368 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 12:51:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:37,368 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:37,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:51:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 12:51:37,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:37,369 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:37,369 INFO L424 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:37,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:37,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2076000136, now seen corresponding path program 234 times [2018-10-15 12:51:37,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 0 proven. 1327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:38,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:38,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:51:38,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:51:38,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:51:38,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=2525, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:51:38,217 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 57 states. [2018-10-15 12:51:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:40,375 INFO L93 Difference]: Finished difference Result 1290 states and 1317 transitions. [2018-10-15 12:51:40,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 12:51:40,376 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 193 [2018-10-15 12:51:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:40,378 INFO L225 Difference]: With dead ends: 1290 [2018-10-15 12:51:40,378 INFO L226 Difference]: Without dead ends: 1284 [2018-10-15 12:51:40,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3578 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3757, Invalid=13273, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:51:40,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2018-10-15 12:51:40,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 410. [2018-10-15 12:51:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:40,383 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 12:51:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:40,383 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:40,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:51:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 12:51:40,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:40,384 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:40,384 INFO L424 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:40,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:40,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1612708743, now seen corresponding path program 235 times [2018-10-15 12:51:40,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1626 backedges. 0 proven. 1626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:41,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:41,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:51:41,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:51:41,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:51:41,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=752, Invalid=2670, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:51:41,389 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 59 states. [2018-10-15 12:51:43,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:43,930 INFO L93 Difference]: Finished difference Result 1128 states and 1155 transitions. [2018-10-15 12:51:43,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-15 12:51:43,931 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 193 [2018-10-15 12:51:43,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:43,932 INFO L225 Difference]: With dead ends: 1128 [2018-10-15 12:51:43,933 INFO L226 Difference]: Without dead ends: 1122 [2018-10-15 12:51:43,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3962 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4254, Invalid=14652, Unknown=0, NotChecked=0, Total=18906 [2018-10-15 12:51:43,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2018-10-15 12:51:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 410. [2018-10-15 12:51:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:51:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 12:51:43,938 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 12:51:43,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:43,938 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 12:51:43,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:51:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 12:51:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 12:51:43,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:43,939 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:43,940 INFO L424 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:43,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:43,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1420626246, now seen corresponding path program 236 times [2018-10-15 12:51:43,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 0 proven. 2015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:44,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:44,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:51:44,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:51:44,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:51:44,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=851, Invalid=2809, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:51:44,961 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 61 states. [2018-10-15 12:51:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:47,919 INFO L93 Difference]: Finished difference Result 903 states and 931 transitions. [2018-10-15 12:51:47,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 12:51:47,920 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 193 [2018-10-15 12:51:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:47,921 INFO L225 Difference]: With dead ends: 903 [2018-10-15 12:51:47,921 INFO L226 Difference]: Without dead ends: 897 [2018-10-15 12:51:47,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4373 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4815, Invalid=16065, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 12:51:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-10-15 12:51:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 416. [2018-10-15 12:51:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:51:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 12:51:47,926 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 193 [2018-10-15 12:51:47,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:47,926 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 12:51:47,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:51:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 12:51:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 12:51:47,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:47,927 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:47,928 INFO L424 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:47,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:47,928 INFO L82 PathProgramCache]: Analyzing trace with hash 980703718, now seen corresponding path program 237 times [2018-10-15 12:51:47,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1579 backedges. 0 proven. 1579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:48,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:48,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:51:48,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:51:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:51:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=1512, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:51:48,518 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 45 states. [2018-10-15 12:51:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:49,603 INFO L93 Difference]: Finished difference Result 765 states and 793 transitions. [2018-10-15 12:51:49,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:51:49,604 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 196 [2018-10-15 12:51:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:49,605 INFO L225 Difference]: With dead ends: 765 [2018-10-15 12:51:49,605 INFO L226 Difference]: Without dead ends: 759 [2018-10-15 12:51:49,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2164, Invalid=5492, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 12:51:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-10-15 12:51:49,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 416. [2018-10-15 12:51:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:51:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 12:51:49,610 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 12:51:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:49,610 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 12:51:49,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:51:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 12:51:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 12:51:49,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:49,611 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:49,611 INFO L424 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:49,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:49,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1976605829, now seen corresponding path program 238 times [2018-10-15 12:51:49,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:50,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:50,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:51:50,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:51:50,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:51:50,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1698, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:51:50,215 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 47 states. [2018-10-15 12:51:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:51,477 INFO L93 Difference]: Finished difference Result 1035 states and 1063 transitions. [2018-10-15 12:51:51,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:51:51,477 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 196 [2018-10-15 12:51:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:51,478 INFO L225 Difference]: With dead ends: 1035 [2018-10-15 12:51:51,478 INFO L226 Difference]: Without dead ends: 1029 [2018-10-15 12:51:51,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2256, Invalid=6674, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:51:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-10-15 12:51:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 416. [2018-10-15 12:51:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:51:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 12:51:51,482 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 12:51:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:51,483 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 12:51:51,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:51:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 12:51:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 12:51:51,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:51,483 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:51,484 INFO L424 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:51,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:51,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1866884892, now seen corresponding path program 239 times [2018-10-15 12:51:51,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 0 proven. 1115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:52,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:52,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:51:52,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:51:52,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:51:52,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=1878, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:51:52,173 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 49 states. [2018-10-15 12:51:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:53,501 INFO L93 Difference]: Finished difference Result 1233 states and 1261 transitions. [2018-10-15 12:51:53,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:51:53,502 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 196 [2018-10-15 12:51:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:53,503 INFO L225 Difference]: With dead ends: 1233 [2018-10-15 12:51:53,503 INFO L226 Difference]: Without dead ends: 1227 [2018-10-15 12:51:53,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2412, Invalid=7890, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 12:51:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2018-10-15 12:51:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 416. [2018-10-15 12:51:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:51:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 12:51:53,508 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 12:51:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:53,509 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 12:51:53,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:51:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 12:51:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 12:51:53,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:53,509 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:53,510 INFO L424 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:53,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:53,510 INFO L82 PathProgramCache]: Analyzing trace with hash 966672131, now seen corresponding path program 240 times [2018-10-15 12:51:53,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 1018 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:54,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:54,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:51:54,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:51:54,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:51:54,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=2052, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:51:54,199 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 51 states. [2018-10-15 12:51:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:55,733 INFO L93 Difference]: Finished difference Result 1359 states and 1387 transitions. [2018-10-15 12:51:55,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:51:55,733 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2018-10-15 12:51:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:55,734 INFO L225 Difference]: With dead ends: 1359 [2018-10-15 12:51:55,734 INFO L226 Difference]: Without dead ends: 1353 [2018-10-15 12:51:55,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2517 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2632, Invalid=9140, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:51:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2018-10-15 12:51:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 416. [2018-10-15 12:51:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:51:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 12:51:55,740 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 12:51:55,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:55,740 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 12:51:55,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:51:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 12:51:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 12:51:55,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:55,741 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:55,741 INFO L424 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:55,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1640595170, now seen corresponding path program 241 times [2018-10-15 12:51:55,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 0 proven. 1011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:56,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:56,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:51:56,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:51:56,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:51:56,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=2220, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:51:56,482 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 53 states. [2018-10-15 12:51:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:58,218 INFO L93 Difference]: Finished difference Result 1413 states and 1441 transitions. [2018-10-15 12:51:58,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:51:58,219 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 196 [2018-10-15 12:51:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:58,220 INFO L225 Difference]: With dead ends: 1413 [2018-10-15 12:51:58,220 INFO L226 Difference]: Without dead ends: 1407 [2018-10-15 12:51:58,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2916, Invalid=10424, Unknown=0, NotChecked=0, Total=13340 [2018-10-15 12:51:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2018-10-15 12:51:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 416. [2018-10-15 12:51:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:51:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 12:51:58,226 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 12:51:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:58,226 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 12:51:58,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:51:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 12:51:58,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 12:51:58,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:58,227 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:58,227 INFO L424 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:58,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:58,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2086815873, now seen corresponding path program 242 times [2018-10-15 12:51:58,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 0 proven. 1094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:59,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:59,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:51:59,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:51:59,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:51:59,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=2382, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:51:59,017 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 55 states. [2018-10-15 12:52:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:00,887 INFO L93 Difference]: Finished difference Result 1408 states and 1436 transitions. [2018-10-15 12:52:00,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:52:00,887 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 196 [2018-10-15 12:52:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:00,888 INFO L225 Difference]: With dead ends: 1408 [2018-10-15 12:52:00,888 INFO L226 Difference]: Without dead ends: 1402 [2018-10-15 12:52:00,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3183 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3264, Invalid=11742, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:52:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-10-15 12:52:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 416. [2018-10-15 12:52:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:52:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 12:52:00,893 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 12:52:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:00,893 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 12:52:00,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:52:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 12:52:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 12:52:00,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:00,894 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:00,894 INFO L424 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:00,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:00,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2104200160, now seen corresponding path program 243 times [2018-10-15 12:52:00,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1267 backedges. 0 proven. 1267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:01,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:01,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:52:01,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:52:01,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:52:01,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=654, Invalid=2538, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:52:01,759 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 57 states. [2018-10-15 12:52:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:03,898 INFO L93 Difference]: Finished difference Result 1354 states and 1382 transitions. [2018-10-15 12:52:03,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:52:03,899 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 196 [2018-10-15 12:52:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:03,900 INFO L225 Difference]: With dead ends: 1354 [2018-10-15 12:52:03,900 INFO L226 Difference]: Without dead ends: 1348 [2018-10-15 12:52:03,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3534 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3676, Invalid=13094, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 12:52:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2018-10-15 12:52:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 416. [2018-10-15 12:52:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:52:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 12:52:03,904 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 12:52:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:03,905 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 12:52:03,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:52:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 12:52:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 12:52:03,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:03,906 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:03,906 INFO L424 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:03,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:03,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1731970817, now seen corresponding path program 244 times [2018-10-15 12:52:03,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 0 proven. 1530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:04,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:04,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:52:04,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:52:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:52:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=2688, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:52:04,809 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 59 states. [2018-10-15 12:52:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:07,160 INFO L93 Difference]: Finished difference Result 1228 states and 1256 transitions. [2018-10-15 12:52:07,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:52:07,160 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 196 [2018-10-15 12:52:07,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:07,161 INFO L225 Difference]: With dead ends: 1228 [2018-10-15 12:52:07,162 INFO L226 Difference]: Without dead ends: 1222 [2018-10-15 12:52:07,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3912 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4152, Invalid=14480, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 12:52:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2018-10-15 12:52:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 416. [2018-10-15 12:52:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:52:07,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 12:52:07,167 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 12:52:07,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:07,167 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 12:52:07,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:52:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 12:52:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 12:52:07,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:07,168 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:07,168 INFO L424 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:07,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:07,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1054392354, now seen corresponding path program 245 times [2018-10-15 12:52:07,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 0 proven. 1883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:08,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:08,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:52:08,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:52:08,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:52:08,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=828, Invalid=2832, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:52:08,127 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 61 states. [2018-10-15 12:52:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:10,756 INFO L93 Difference]: Finished difference Result 1030 states and 1058 transitions. [2018-10-15 12:52:10,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:52:10,757 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 196 [2018-10-15 12:52:10,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:10,758 INFO L225 Difference]: With dead ends: 1030 [2018-10-15 12:52:10,758 INFO L226 Difference]: Without dead ends: 1024 [2018-10-15 12:52:10,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4317 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4692, Invalid=15900, Unknown=0, NotChecked=0, Total=20592 [2018-10-15 12:52:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2018-10-15 12:52:10,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 416. [2018-10-15 12:52:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:52:10,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 12:52:10,763 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 12:52:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:10,763 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 12:52:10,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:52:10,764 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 12:52:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:52:10,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:10,765 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:10,765 INFO L424 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:10,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:10,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2059974780, now seen corresponding path program 20 times [2018-10-15 12:52:10,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1750 backedges. 0 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:11,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:11,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:52:11,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:52:11,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:52:11,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1493, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:52:11,379 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 45 states. [2018-10-15 12:52:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:12,551 INFO L93 Difference]: Finished difference Result 610 states and 638 transitions. [2018-10-15 12:52:12,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 12:52:12,551 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 199 [2018-10-15 12:52:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:12,552 INFO L225 Difference]: With dead ends: 610 [2018-10-15 12:52:12,552 INFO L226 Difference]: Without dead ends: 604 [2018-10-15 12:52:12,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2217, Invalid=5265, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:52:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-10-15 12:52:12,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 428. [2018-10-15 12:52:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 12:52:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 12:52:12,556 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 12:52:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:12,556 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 12:52:12,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:52:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 12:52:12,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:52:12,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:12,557 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:12,557 INFO L424 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:12,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:12,557 INFO L82 PathProgramCache]: Analyzing trace with hash -273418051, now seen corresponding path program 246 times [2018-10-15 12:52:12,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 1437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:13,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:13,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:52:13,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:52:13,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:52:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1684, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:52:13,151 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 47 states. [2018-10-15 12:52:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:14,312 INFO L93 Difference]: Finished difference Result 1075 states and 1103 transitions. [2018-10-15 12:52:14,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 12:52:14,312 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 199 [2018-10-15 12:52:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:14,313 INFO L225 Difference]: With dead ends: 1075 [2018-10-15 12:52:14,314 INFO L226 Difference]: Without dead ends: 1069 [2018-10-15 12:52:14,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1692 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2288, Invalid=6454, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 12:52:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-10-15 12:52:14,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 428. [2018-10-15 12:52:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 12:52:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 12:52:14,319 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 12:52:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:14,319 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 12:52:14,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:52:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 12:52:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:52:14,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:14,320 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:14,320 INFO L424 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:14,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1939376322, now seen corresponding path program 247 times [2018-10-15 12:52:14,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 0 proven. 1214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:15,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:15,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:52:15,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:52:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:52:15,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1869, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:52:15,005 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 49 states. [2018-10-15 12:52:16,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:16,357 INFO L93 Difference]: Finished difference Result 1291 states and 1319 transitions. [2018-10-15 12:52:16,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 12:52:16,358 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 199 [2018-10-15 12:52:16,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:16,359 INFO L225 Difference]: With dead ends: 1291 [2018-10-15 12:52:16,359 INFO L226 Difference]: Without dead ends: 1285 [2018-10-15 12:52:16,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2423, Invalid=7677, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:52:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2018-10-15 12:52:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 428. [2018-10-15 12:52:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 12:52:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 12:52:16,365 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 12:52:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:16,365 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 12:52:16,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:52:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 12:52:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:52:16,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:16,366 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:16,366 INFO L424 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:16,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:16,367 INFO L82 PathProgramCache]: Analyzing trace with hash -666745857, now seen corresponding path program 248 times [2018-10-15 12:52:16,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:17,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:17,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:52:17,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:52:17,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:52:17,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=2048, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:52:17,094 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 51 states. [2018-10-15 12:52:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:18,570 INFO L93 Difference]: Finished difference Result 1435 states and 1463 transitions. [2018-10-15 12:52:18,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 12:52:18,570 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 199 [2018-10-15 12:52:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:18,572 INFO L225 Difference]: With dead ends: 1435 [2018-10-15 12:52:18,572 INFO L226 Difference]: Without dead ends: 1429 [2018-10-15 12:52:18,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2461 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2622, Invalid=8934, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 12:52:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2018-10-15 12:52:18,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 428. [2018-10-15 12:52:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 12:52:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 12:52:18,578 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 12:52:18,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:18,578 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 12:52:18,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:52:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 12:52:18,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:52:18,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:18,579 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:18,579 INFO L424 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:18,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:18,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1891143936, now seen corresponding path program 249 times [2018-10-15 12:52:18,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 0 proven. 1038 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:19,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:19,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:52:19,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:52:19,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:52:19,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=2221, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:52:19,361 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 53 states. [2018-10-15 12:52:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:21,009 INFO L93 Difference]: Finished difference Result 1507 states and 1535 transitions. [2018-10-15 12:52:21,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 12:52:21,009 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 199 [2018-10-15 12:52:21,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:21,011 INFO L225 Difference]: With dead ends: 1507 [2018-10-15 12:52:21,011 INFO L226 Difference]: Without dead ends: 1501 [2018-10-15 12:52:21,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2814 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2885, Invalid=10225, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:52:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2018-10-15 12:52:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 428. [2018-10-15 12:52:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 12:52:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 12:52:21,016 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 12:52:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:21,016 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 12:52:21,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:52:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 12:52:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:52:21,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:21,017 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:21,017 INFO L424 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:21,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:21,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1126041665, now seen corresponding path program 250 times [2018-10-15 12:52:21,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 0 proven. 1085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:21,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:21,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:52:21,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:52:21,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:52:21,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=2388, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:52:21,782 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 55 states. [2018-10-15 12:52:23,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:23,607 INFO L93 Difference]: Finished difference Result 1511 states and 1539 transitions. [2018-10-15 12:52:23,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 12:52:23,608 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 199 [2018-10-15 12:52:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:23,609 INFO L225 Difference]: With dead ends: 1511 [2018-10-15 12:52:23,609 INFO L226 Difference]: Without dead ends: 1505 [2018-10-15 12:52:23,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3147 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3212, Invalid=11550, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 12:52:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2018-10-15 12:52:23,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 428. [2018-10-15 12:52:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 12:52:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 12:52:23,615 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 12:52:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:23,615 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 12:52:23,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:52:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 12:52:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:52:23,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:23,616 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:23,616 INFO L424 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:23,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:23,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1007755202, now seen corresponding path program 251 times [2018-10-15 12:52:23,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1222 backedges. 0 proven. 1222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:24,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:24,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:52:24,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:52:24,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:52:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=2549, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:52:24,447 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 57 states. [2018-10-15 12:52:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:26,499 INFO L93 Difference]: Finished difference Result 1475 states and 1503 transitions. [2018-10-15 12:52:26,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 12:52:26,500 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 199 [2018-10-15 12:52:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:26,501 INFO L225 Difference]: With dead ends: 1475 [2018-10-15 12:52:26,501 INFO L226 Difference]: Without dead ends: 1469 [2018-10-15 12:52:26,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3492 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3603, Invalid=12909, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 12:52:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-10-15 12:52:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 428. [2018-10-15 12:52:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 12:52:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 12:52:26,507 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 12:52:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:26,507 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 12:52:26,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:52:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 12:52:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:52:26,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:26,508 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:26,508 INFO L424 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:26,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:26,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1710242429, now seen corresponding path program 252 times [2018-10-15 12:52:26,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1449 backedges. 0 proven. 1449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:27,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:27,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:52:27,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:52:27,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:52:27,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=718, Invalid=2704, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:52:27,507 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 59 states. [2018-10-15 12:52:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:29,806 INFO L93 Difference]: Finished difference Result 1367 states and 1395 transitions. [2018-10-15 12:52:29,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 12:52:29,806 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 199 [2018-10-15 12:52:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:29,807 INFO L225 Difference]: With dead ends: 1367 [2018-10-15 12:52:29,808 INFO L226 Difference]: Without dead ends: 1361 [2018-10-15 12:52:29,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3864 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4058, Invalid=14302, Unknown=0, NotChecked=0, Total=18360 [2018-10-15 12:52:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-10-15 12:52:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 428. [2018-10-15 12:52:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 12:52:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 12:52:29,813 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 12:52:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:29,813 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 12:52:29,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:52:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 12:52:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:52:29,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:29,814 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:29,814 INFO L424 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:29,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:29,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1246951036, now seen corresponding path program 253 times [2018-10-15 12:52:29,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1766 backedges. 0 proven. 1766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:30,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:30,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:52:30,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:52:30,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:52:30,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=2853, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:52:30,774 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 61 states. [2018-10-15 12:52:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:33,405 INFO L93 Difference]: Finished difference Result 1187 states and 1215 transitions. [2018-10-15 12:52:33,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 12:52:33,405 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 199 [2018-10-15 12:52:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:33,406 INFO L225 Difference]: With dead ends: 1187 [2018-10-15 12:52:33,407 INFO L226 Difference]: Without dead ends: 1181 [2018-10-15 12:52:33,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4263 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4577, Invalid=15729, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:52:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-10-15 12:52:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 428. [2018-10-15 12:52:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 12:52:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 12:52:33,412 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 12:52:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:33,412 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 12:52:33,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:52:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 12:52:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:52:33,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:33,413 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:33,413 INFO L424 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:33,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:33,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1054868539, now seen corresponding path program 254 times [2018-10-15 12:52:33,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2173 backedges. 0 proven. 2173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:34,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:34,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:52:34,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:52:34,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:52:34,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=2996, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:52:34,449 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 63 states. [2018-10-15 12:52:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:37,302 INFO L93 Difference]: Finished difference Result 944 states and 973 transitions. [2018-10-15 12:52:37,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 12:52:37,302 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 199 [2018-10-15 12:52:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:37,303 INFO L225 Difference]: With dead ends: 944 [2018-10-15 12:52:37,303 INFO L226 Difference]: Without dead ends: 938 [2018-10-15 12:52:37,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4689 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5160, Invalid=17190, Unknown=0, NotChecked=0, Total=22350 [2018-10-15 12:52:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-10-15 12:52:37,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 434. [2018-10-15 12:52:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:52:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 12:52:37,308 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 199 [2018-10-15 12:52:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:37,308 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 12:52:37,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:52:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 12:52:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:52:37,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:37,309 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:37,309 INFO L424 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:37,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash 936523003, now seen corresponding path program 255 times [2018-10-15 12:52:37,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 0 proven. 1587 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:37,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:37,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:52:37,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:52:37,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:52:37,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=1668, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:52:37,928 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 47 states. [2018-10-15 12:52:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:39,115 INFO L93 Difference]: Finished difference Result 950 states and 979 transitions. [2018-10-15 12:52:39,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 12:52:39,115 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 202 [2018-10-15 12:52:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:39,116 INFO L225 Difference]: With dead ends: 950 [2018-10-15 12:52:39,116 INFO L226 Difference]: Without dead ends: 944 [2018-10-15 12:52:39,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2328, Invalid=6228, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:52:39,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-10-15 12:52:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 434. [2018-10-15 12:52:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:52:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 12:52:39,121 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 12:52:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:39,121 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 12:52:39,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:52:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 12:52:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:52:39,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:39,122 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:39,122 INFO L424 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:39,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:39,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1932425114, now seen corresponding path program 256 times [2018-10-15 12:52:39,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 0 proven. 1328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:39,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:39,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:52:39,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:52:39,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:52:39,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=1858, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:52:39,754 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 49 states. [2018-10-15 12:52:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:41,011 INFO L93 Difference]: Finished difference Result 1202 states and 1231 transitions. [2018-10-15 12:52:41,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 12:52:41,011 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 202 [2018-10-15 12:52:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:41,012 INFO L225 Difference]: With dead ends: 1202 [2018-10-15 12:52:41,012 INFO L226 Difference]: Without dead ends: 1196 [2018-10-15 12:52:41,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2011 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2442, Invalid=7458, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 12:52:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-10-15 12:52:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 434. [2018-10-15 12:52:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:52:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 12:52:41,017 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 12:52:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:41,017 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 12:52:41,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:52:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 12:52:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:52:41,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:41,018 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:41,018 INFO L424 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:41,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:41,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1911065607, now seen corresponding path program 257 times [2018-10-15 12:52:41,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 1159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:41,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:41,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:52:41,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:52:41,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:52:41,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=2042, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:52:41,695 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 51 states. [2018-10-15 12:52:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:43,126 INFO L93 Difference]: Finished difference Result 1382 states and 1411 transitions. [2018-10-15 12:52:43,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 12:52:43,126 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 202 [2018-10-15 12:52:43,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:43,128 INFO L225 Difference]: With dead ends: 1382 [2018-10-15 12:52:43,128 INFO L226 Difference]: Without dead ends: 1376 [2018-10-15 12:52:43,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2399 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2620, Invalid=8722, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:52:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2018-10-15 12:52:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 434. [2018-10-15 12:52:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:52:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 12:52:43,133 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 12:52:43,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:43,133 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 12:52:43,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:52:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 12:52:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:52:43,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:43,134 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:43,134 INFO L424 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:43,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash 922491416, now seen corresponding path program 258 times [2018-10-15 12:52:43,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:43,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:43,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:52:43,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:52:43,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:52:43,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=2220, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:52:43,860 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 53 states. [2018-10-15 12:52:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:45,375 INFO L93 Difference]: Finished difference Result 1490 states and 1519 transitions. [2018-10-15 12:52:45,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 12:52:45,376 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 202 [2018-10-15 12:52:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:45,377 INFO L225 Difference]: With dead ends: 1490 [2018-10-15 12:52:45,377 INFO L226 Difference]: Without dead ends: 1484 [2018-10-15 12:52:45,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2766 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2862, Invalid=10020, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 12:52:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2018-10-15 12:52:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 434. [2018-10-15 12:52:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:52:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 12:52:45,383 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 12:52:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:45,383 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 12:52:45,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:52:45,383 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 12:52:45,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:52:45,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:45,384 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:45,384 INFO L424 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:45,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:45,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1596414455, now seen corresponding path program 259 times [2018-10-15 12:52:45,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 1091 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:46,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:46,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:52:46,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:52:46,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:52:46,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=2392, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:52:46,156 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 55 states. [2018-10-15 12:52:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:47,948 INFO L93 Difference]: Finished difference Result 1526 states and 1555 transitions. [2018-10-15 12:52:47,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 12:52:47,949 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 202 [2018-10-15 12:52:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:47,950 INFO L225 Difference]: With dead ends: 1526 [2018-10-15 12:52:47,950 INFO L226 Difference]: Without dead ends: 1520 [2018-10-15 12:52:47,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3112 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3168, Invalid=11352, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 12:52:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-10-15 12:52:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 434. [2018-10-15 12:52:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:52:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 12:52:47,956 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 12:52:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:47,956 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 12:52:47,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:52:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 12:52:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:52:47,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:47,957 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:47,957 INFO L424 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:47,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:47,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2042635158, now seen corresponding path program 260 times [2018-10-15 12:52:47,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1192 backedges. 0 proven. 1192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:48,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:48,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:52:48,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:52:48,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:52:48,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=2558, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:52:48,781 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 57 states. [2018-10-15 12:52:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:50,717 INFO L93 Difference]: Finished difference Result 1512 states and 1541 transitions. [2018-10-15 12:52:50,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-15 12:52:50,717 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 202 [2018-10-15 12:52:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:50,719 INFO L225 Difference]: With dead ends: 1512 [2018-10-15 12:52:50,719 INFO L226 Difference]: Without dead ends: 1506 [2018-10-15 12:52:50,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3452 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3538, Invalid=12718, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 12:52:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2018-10-15 12:52:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 434. [2018-10-15 12:52:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:52:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 12:52:50,724 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 12:52:50,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:50,724 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 12:52:50,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:52:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 12:52:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:52:50,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:50,725 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:50,725 INFO L424 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:50,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2060019445, now seen corresponding path program 261 times [2018-10-15 12:52:50,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:51,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 0 proven. 1383 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:51,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:51,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:52:51,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:52:51,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:52:51,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=2718, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:52:51,615 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 59 states. [2018-10-15 12:52:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:53,849 INFO L93 Difference]: Finished difference Result 1440 states and 1469 transitions. [2018-10-15 12:52:53,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-15 12:52:53,849 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 202 [2018-10-15 12:52:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:53,851 INFO L225 Difference]: With dead ends: 1440 [2018-10-15 12:52:53,851 INFO L226 Difference]: Without dead ends: 1434 [2018-10-15 12:52:53,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3818 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3972, Invalid=14118, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:52:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2018-10-15 12:52:53,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 434. [2018-10-15 12:52:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:52:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 12:52:53,857 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 12:52:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:53,857 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 12:52:53,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:52:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 12:52:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:52:53,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:53,858 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:53,858 INFO L424 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:53,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:53,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1776151532, now seen corresponding path program 262 times [2018-10-15 12:52:53,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 0 proven. 1664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:54,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:54,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:52:54,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:52:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:52:54,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=788, Invalid=2872, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:52:54,806 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 61 states. [2018-10-15 12:52:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:57,308 INFO L93 Difference]: Finished difference Result 1296 states and 1325 transitions. [2018-10-15 12:52:57,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-15 12:52:57,308 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 202 [2018-10-15 12:52:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:57,309 INFO L225 Difference]: With dead ends: 1296 [2018-10-15 12:52:57,310 INFO L226 Difference]: Without dead ends: 1290 [2018-10-15 12:52:57,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4211 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4470, Invalid=15552, Unknown=0, NotChecked=0, Total=20022 [2018-10-15 12:52:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-10-15 12:52:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 434. [2018-10-15 12:52:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:52:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 12:52:57,314 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 12:52:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:57,315 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 12:52:57,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:52:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 12:52:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:52:57,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:57,315 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:57,316 INFO L424 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:57,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:57,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1098573069, now seen corresponding path program 263 times [2018-10-15 12:52:57,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:58,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:58,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:52:58,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:52:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:52:58,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=886, Invalid=3020, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:52:58,333 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 63 states.