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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:36:08,019 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:36:08,026 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:36:08,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:36:08,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:36:08,043 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:36:08,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:36:08,046 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:36:08,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:36:08,048 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:36:08,049 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:36:08,049 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:36:08,050 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:36:08,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:36:08,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:36:08,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:36:08,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:36:08,057 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:36:08,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:36:08,061 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:36:08,062 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:36:08,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:36:08,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:36:08,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:36:08,066 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:36:08,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:36:08,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:36:08,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:36:08,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:36:08,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:36:08,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:36:08,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:36:08,072 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:36:08,072 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:36:08,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:36:08,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:36:08,074 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 15:36:08,083 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:36:08,084 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:36:08,085 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:36:08,085 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:36:08,085 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:36:08,086 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:36:08,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:36:08,087 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:36:08,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:36:08,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:36:08,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:36:08,087 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:36:08,088 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:36:08,088 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:36:08,088 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:36:08,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:36:08,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:36:08,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:36:08,183 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:36:08,184 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:36:08,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl [2018-10-15 15:36:08,185 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl' [2018-10-15 15:36:08,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:36:08,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:36:08,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:36:08,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:36:08,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:36:08,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:36:08" (1/1) ... [2018-10-15 15:36:08,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:36:08" (1/1) ... [2018-10-15 15:36:08,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:36:08" (1/1) ... [2018-10-15 15:36:08,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:36:08" (1/1) ... [2018-10-15 15:36:08,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:36:08" (1/1) ... [2018-10-15 15:36:08,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:36:08" (1/1) ... [2018-10-15 15:36:08,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:36:08" (1/1) ... [2018-10-15 15:36:08,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:36:08,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:36:08,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:36:08,337 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:36:08,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:36:08" (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 15:36:08,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:36:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:36:08,981 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:36:08,981 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:36:08 BoogieIcfgContainer [2018-10-15 15:36:08,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:36:08,982 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:36:08,982 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:36:08,983 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:36:08,987 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:36:08" (1/1) ... [2018-10-15 15:36:08,992 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:36:09,009 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:36:09 BasicIcfg [2018-10-15 15:36:09,009 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:36:09,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:36:09,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:36:09,014 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:36:09,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:36:08" (1/3) ... [2018-10-15 15:36:09,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470ed533 and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:36:09, skipping insertion in model container [2018-10-15 15:36:09,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:36:08" (2/3) ... [2018-10-15 15:36:09,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470ed533 and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:36:09, skipping insertion in model container [2018-10-15 15:36:09,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:36:09" (3/3) ... [2018-10-15 15:36:09,018 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal.i_5.bplleft_unchanged_by_heapseparator [2018-10-15 15:36:09,028 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:36:09,039 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:36:09,056 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:36:09,082 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:36:09,083 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:36:09,083 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:36:09,083 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:36:09,083 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:36:09,083 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:36:09,083 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:36:09,083 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:36:09,084 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:36:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-10-15 15:36:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 15:36:09,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:09,108 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:09,109 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:09,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1668700705, now seen corresponding path program 1 times [2018-10-15 15:36:09,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:09,309 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 15:36:09,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:36:09,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:36:09,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:36:09,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:36:09,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:36:09,334 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 3 states. [2018-10-15 15:36:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:09,499 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-10-15 15:36:09,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:36:09,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-15 15:36:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:09,515 INFO L225 Difference]: With dead ends: 91 [2018-10-15 15:36:09,515 INFO L226 Difference]: Without dead ends: 91 [2018-10-15 15:36:09,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:36:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-15 15:36:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2018-10-15 15:36:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 15:36:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-10-15 15:36:09,562 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 40 [2018-10-15 15:36:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:09,562 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-10-15 15:36:09,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:36:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-10-15 15:36:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 15:36:09,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:09,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:09,567 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:09,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:09,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1308635927, now seen corresponding path program 1 times [2018-10-15 15:36:09,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:09,763 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 15:36:09,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:09,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:36:09,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:36:09,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:36:09,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:36:09,767 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 5 states. [2018-10-15 15:36:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:10,139 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-10-15 15:36:10,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:36:10,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-15 15:36:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:10,145 INFO L225 Difference]: With dead ends: 99 [2018-10-15 15:36:10,145 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 15:36:10,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:36:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 15:36:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 73. [2018-10-15 15:36:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 15:36:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-10-15 15:36:10,162 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 48 [2018-10-15 15:36:10,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:10,163 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-10-15 15:36:10,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:36:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-10-15 15:36:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-15 15:36:10,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:10,167 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:10,168 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:10,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:10,168 INFO L82 PathProgramCache]: Analyzing trace with hash 688605683, now seen corresponding path program 2 times [2018-10-15 15:36:10,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:10,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:10,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:36:10,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:36:10,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:36:10,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:36:10,482 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 7 states. [2018-10-15 15:36:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:10,706 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-10-15 15:36:10,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:36:10,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-10-15 15:36:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:10,712 INFO L225 Difference]: With dead ends: 107 [2018-10-15 15:36:10,712 INFO L226 Difference]: Without dead ends: 107 [2018-10-15 15:36:10,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:36:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-15 15:36:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 81. [2018-10-15 15:36:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 15:36:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-10-15 15:36:10,731 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 56 [2018-10-15 15:36:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:10,731 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-10-15 15:36:10,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:36:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-10-15 15:36:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 15:36:10,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:10,734 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:10,734 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:10,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:10,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1711923971, now seen corresponding path program 3 times [2018-10-15 15:36:10,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:11,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:11,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:36:11,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:36:11,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:36:11,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:36:11,241 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 9 states. [2018-10-15 15:36:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:11,739 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-10-15 15:36:11,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 15:36:11,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-10-15 15:36:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:11,741 INFO L225 Difference]: With dead ends: 115 [2018-10-15 15:36:11,742 INFO L226 Difference]: Without dead ends: 115 [2018-10-15 15:36:11,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:36:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-15 15:36:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2018-10-15 15:36:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-15 15:36:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-10-15 15:36:11,764 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 64 [2018-10-15 15:36:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:11,765 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-10-15 15:36:11,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:36:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-10-15 15:36:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 15:36:11,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:11,773 INFO L375 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:11,773 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:11,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:11,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1291172345, now seen corresponding path program 4 times [2018-10-15 15:36:11,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:12,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:12,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:36:12,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:36:12,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:36:12,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:36:12,452 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 11 states. [2018-10-15 15:36:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:13,216 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-10-15 15:36:13,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:36:13,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-10-15 15:36:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:13,219 INFO L225 Difference]: With dead ends: 123 [2018-10-15 15:36:13,220 INFO L226 Difference]: Without dead ends: 123 [2018-10-15 15:36:13,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:36:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-15 15:36:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2018-10-15 15:36:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 15:36:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-10-15 15:36:13,228 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 72 [2018-10-15 15:36:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:13,229 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-10-15 15:36:13,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:36:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-10-15 15:36:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 15:36:13,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:13,231 INFO L375 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:13,231 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:13,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:13,232 INFO L82 PathProgramCache]: Analyzing trace with hash 949077265, now seen corresponding path program 5 times [2018-10-15 15:36:13,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:13,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:13,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:36:13,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:36:13,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:36:13,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:36:13,476 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 13 states. [2018-10-15 15:36:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:14,136 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-10-15 15:36:14,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:36:14,136 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-10-15 15:36:14,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:14,138 INFO L225 Difference]: With dead ends: 131 [2018-10-15 15:36:14,139 INFO L226 Difference]: Without dead ends: 131 [2018-10-15 15:36:14,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:36:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-15 15:36:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 105. [2018-10-15 15:36:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 15:36:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2018-10-15 15:36:14,147 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 80 [2018-10-15 15:36:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:14,147 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2018-10-15 15:36:14,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:36:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2018-10-15 15:36:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 15:36:14,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:14,150 INFO L375 BasicCegarLoop]: trace histogram [7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:14,150 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:14,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:14,151 INFO L82 PathProgramCache]: Analyzing trace with hash 81173019, now seen corresponding path program 6 times [2018-10-15 15:36:14,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:14,613 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 15:36:14,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:14,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:36:14,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:36:14,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:36:14,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:36:14,615 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand 15 states. [2018-10-15 15:36:15,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:15,841 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-10-15 15:36:15,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 15:36:15,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2018-10-15 15:36:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:15,843 INFO L225 Difference]: With dead ends: 139 [2018-10-15 15:36:15,843 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 15:36:15,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:36:15,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 15:36:15,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2018-10-15 15:36:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-15 15:36:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2018-10-15 15:36:15,861 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 88 [2018-10-15 15:36:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:15,861 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2018-10-15 15:36:15,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:36:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2018-10-15 15:36:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 15:36:15,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:15,868 INFO L375 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:15,868 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:15,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash 136496421, now seen corresponding path program 7 times [2018-10-15 15:36:15,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:16,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:16,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:36:16,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:36:16,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:36:16,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:36:16,461 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand 17 states. [2018-10-15 15:36:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:17,501 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-10-15 15:36:17,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 15:36:17,502 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-10-15 15:36:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:17,504 INFO L225 Difference]: With dead ends: 147 [2018-10-15 15:36:17,504 INFO L226 Difference]: Without dead ends: 147 [2018-10-15 15:36:17,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:36:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-15 15:36:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2018-10-15 15:36:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 15:36:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 124 transitions. [2018-10-15 15:36:17,510 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 124 transitions. Word has length 96 [2018-10-15 15:36:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:17,510 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 124 transitions. [2018-10-15 15:36:17,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:36:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2018-10-15 15:36:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 15:36:17,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:17,512 INFO L375 BasicCegarLoop]: trace histogram [9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:17,513 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:17,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:17,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1220560431, now seen corresponding path program 8 times [2018-10-15 15:36:17,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:18,149 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 15:36:18,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:18,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:36:18,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:36:18,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:36:18,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:36:18,151 INFO L87 Difference]: Start difference. First operand 121 states and 124 transitions. Second operand 19 states. [2018-10-15 15:36:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:19,034 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-10-15 15:36:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 15:36:19,035 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 104 [2018-10-15 15:36:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:19,037 INFO L225 Difference]: With dead ends: 155 [2018-10-15 15:36:19,037 INFO L226 Difference]: Without dead ends: 155 [2018-10-15 15:36:19,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:36:19,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-15 15:36:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 129. [2018-10-15 15:36:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-15 15:36:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2018-10-15 15:36:19,042 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2018-10-15 15:36:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:19,043 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2018-10-15 15:36:19,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:36:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2018-10-15 15:36:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 15:36:19,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:19,045 INFO L375 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:19,045 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:19,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:19,045 INFO L82 PathProgramCache]: Analyzing trace with hash -486990535, now seen corresponding path program 9 times [2018-10-15 15:36:19,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:19,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:19,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:36:19,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:36:19,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:36:19,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:36:19,732 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand 21 states. [2018-10-15 15:36:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:21,038 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2018-10-15 15:36:21,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 15:36:21,038 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 112 [2018-10-15 15:36:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:21,040 INFO L225 Difference]: With dead ends: 163 [2018-10-15 15:36:21,041 INFO L226 Difference]: Without dead ends: 163 [2018-10-15 15:36:21,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:36:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-15 15:36:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2018-10-15 15:36:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 15:36:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2018-10-15 15:36:21,046 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 112 [2018-10-15 15:36:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:21,047 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2018-10-15 15:36:21,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:36:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2018-10-15 15:36:21,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 15:36:21,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:21,049 INFO L375 BasicCegarLoop]: trace histogram [11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:21,049 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:21,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:21,049 INFO L82 PathProgramCache]: Analyzing trace with hash 152521283, now seen corresponding path program 10 times [2018-10-15 15:36:21,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 15:36:21,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:36:21,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-15 15:36:21,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:36:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:36:21,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:36:21,356 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 6 states. [2018-10-15 15:36:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:21,436 INFO L93 Difference]: Finished difference Result 152 states and 156 transitions. [2018-10-15 15:36:21,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:36:21,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-10-15 15:36:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:21,440 INFO L225 Difference]: With dead ends: 152 [2018-10-15 15:36:21,440 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 15:36:21,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:36:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 15:36:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2018-10-15 15:36:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 15:36:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-10-15 15:36:21,445 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 120 [2018-10-15 15:36:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:21,445 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-10-15 15:36:21,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:36:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-10-15 15:36:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-15 15:36:21,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:21,448 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 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, 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 15:36:21,448 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:21,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:21,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1734991028, now seen corresponding path program 1 times [2018-10-15 15:36:21,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 15:36:21,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:21,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:36:21,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:36:21,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:36:21,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:36:21,718 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 5 states. [2018-10-15 15:36:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:21,770 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-10-15 15:36:21,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:36:21,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-10-15 15:36:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:21,772 INFO L225 Difference]: With dead ends: 159 [2018-10-15 15:36:21,772 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 15:36:21,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:36:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 15:36:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2018-10-15 15:36:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 15:36:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 153 transitions. [2018-10-15 15:36:21,778 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 153 transitions. Word has length 137 [2018-10-15 15:36:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:21,779 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 153 transitions. [2018-10-15 15:36:21,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:36:21,779 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 153 transitions. [2018-10-15 15:36:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 15:36:21,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:21,781 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 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, 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 15:36:21,781 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:21,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:21,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1139032434, now seen corresponding path program 2 times [2018-10-15 15:36:21,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 15:36:22,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:22,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:36:22,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:36:22,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:36:22,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:36:22,499 INFO L87 Difference]: Start difference. First operand 150 states and 153 transitions. Second operand 7 states. [2018-10-15 15:36:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:22,714 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-10-15 15:36:22,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:36:22,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2018-10-15 15:36:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:22,716 INFO L225 Difference]: With dead ends: 165 [2018-10-15 15:36:22,716 INFO L226 Difference]: Without dead ends: 165 [2018-10-15 15:36:22,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:36:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-15 15:36:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2018-10-15 15:36:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-15 15:36:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 162 transitions. [2018-10-15 15:36:22,721 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 162 transitions. Word has length 146 [2018-10-15 15:36:22,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:22,721 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 162 transitions. [2018-10-15 15:36:22,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:36:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2018-10-15 15:36:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-15 15:36:22,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:22,723 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 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, 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 15:36:22,723 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:22,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:22,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1316924940, now seen corresponding path program 3 times [2018-10-15 15:36:22,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 15:36:23,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:23,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:36:23,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:36:23,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:36:23,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:36:23,053 INFO L87 Difference]: Start difference. First operand 159 states and 162 transitions. Second operand 9 states. [2018-10-15 15:36:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:23,294 INFO L93 Difference]: Finished difference Result 174 states and 177 transitions. [2018-10-15 15:36:23,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 15:36:23,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2018-10-15 15:36:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:23,297 INFO L225 Difference]: With dead ends: 174 [2018-10-15 15:36:23,297 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 15:36:23,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:36:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 15:36:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 168. [2018-10-15 15:36:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-15 15:36:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 171 transitions. [2018-10-15 15:36:23,302 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 171 transitions. Word has length 155 [2018-10-15 15:36:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:23,302 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 171 transitions. [2018-10-15 15:36:23,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:36:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 171 transitions. [2018-10-15 15:36:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-15 15:36:23,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:23,303 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 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, 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 15:36:23,304 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:23,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2129932622, now seen corresponding path program 4 times [2018-10-15 15:36:23,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 15:36:23,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:23,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:36:23,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:36:23,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:36:23,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:36:23,756 INFO L87 Difference]: Start difference. First operand 168 states and 171 transitions. Second operand 11 states. [2018-10-15 15:36:24,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:24,034 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2018-10-15 15:36:24,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:36:24,034 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 164 [2018-10-15 15:36:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:24,036 INFO L225 Difference]: With dead ends: 183 [2018-10-15 15:36:24,037 INFO L226 Difference]: Without dead ends: 183 [2018-10-15 15:36:24,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:36:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-15 15:36:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2018-10-15 15:36:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-15 15:36:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 180 transitions. [2018-10-15 15:36:24,041 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 180 transitions. Word has length 164 [2018-10-15 15:36:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:24,042 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 180 transitions. [2018-10-15 15:36:24,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:36:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 180 transitions. [2018-10-15 15:36:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-15 15:36:24,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:24,043 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 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, 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 15:36:24,043 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:24,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1927416012, now seen corresponding path program 5 times [2018-10-15 15:36:24,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 15:36:24,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:24,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:36:24,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:36:24,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:36:24,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:36:24,299 INFO L87 Difference]: Start difference. First operand 177 states and 180 transitions. Second operand 13 states. [2018-10-15 15:36:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:24,668 INFO L93 Difference]: Finished difference Result 192 states and 195 transitions. [2018-10-15 15:36:24,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:36:24,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 173 [2018-10-15 15:36:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:24,670 INFO L225 Difference]: With dead ends: 192 [2018-10-15 15:36:24,670 INFO L226 Difference]: Without dead ends: 192 [2018-10-15 15:36:24,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:36:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-15 15:36:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 186. [2018-10-15 15:36:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-15 15:36:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 189 transitions. [2018-10-15 15:36:24,675 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 189 transitions. Word has length 173 [2018-10-15 15:36:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:24,676 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 189 transitions. [2018-10-15 15:36:24,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:36:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2018-10-15 15:36:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 15:36:24,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:24,677 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 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, 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 15:36:24,677 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:24,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1528656910, now seen corresponding path program 6 times [2018-10-15 15:36:24,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 2 proven. 147 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 15:36:25,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:25,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:36:25,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:36:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:36:25,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:36:25,144 INFO L87 Difference]: Start difference. First operand 186 states and 189 transitions. Second operand 15 states. [2018-10-15 15:36:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:25,904 INFO L93 Difference]: Finished difference Result 201 states and 204 transitions. [2018-10-15 15:36:25,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 15:36:25,904 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 182 [2018-10-15 15:36:25,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:25,907 INFO L225 Difference]: With dead ends: 201 [2018-10-15 15:36:25,907 INFO L226 Difference]: Without dead ends: 201 [2018-10-15 15:36:25,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:36:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-15 15:36:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 195. [2018-10-15 15:36:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-15 15:36:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 198 transitions. [2018-10-15 15:36:25,911 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 198 transitions. Word has length 182 [2018-10-15 15:36:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:25,912 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 198 transitions. [2018-10-15 15:36:25,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:36:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 198 transitions. [2018-10-15 15:36:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-15 15:36:25,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:25,913 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 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, 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 15:36:25,914 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:25,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:25,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1968426100, now seen corresponding path program 7 times [2018-10-15 15:36:25,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 2 proven. 203 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 15:36:26,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:26,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:36:26,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:36:26,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:36:26,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:36:26,817 INFO L87 Difference]: Start difference. First operand 195 states and 198 transitions. Second operand 17 states. [2018-10-15 15:36:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:27,688 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2018-10-15 15:36:27,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 15:36:27,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 191 [2018-10-15 15:36:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:27,690 INFO L225 Difference]: With dead ends: 210 [2018-10-15 15:36:27,690 INFO L226 Difference]: Without dead ends: 210 [2018-10-15 15:36:27,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:36:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-15 15:36:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 204. [2018-10-15 15:36:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-15 15:36:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 207 transitions. [2018-10-15 15:36:27,696 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 207 transitions. Word has length 191 [2018-10-15 15:36:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:27,697 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 207 transitions. [2018-10-15 15:36:27,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:36:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 207 transitions. [2018-10-15 15:36:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-15 15:36:27,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:27,698 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 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, 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 15:36:27,699 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:27,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:27,699 INFO L82 PathProgramCache]: Analyzing trace with hash 201557710, now seen corresponding path program 8 times [2018-10-15 15:36:27,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 2 proven. 268 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 15:36:28,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:28,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:36:28,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:36:28,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:36:28,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:36:28,153 INFO L87 Difference]: Start difference. First operand 204 states and 207 transitions. Second operand 19 states. [2018-10-15 15:36:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:28,977 INFO L93 Difference]: Finished difference Result 219 states and 222 transitions. [2018-10-15 15:36:28,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 15:36:28,980 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 200 [2018-10-15 15:36:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:28,981 INFO L225 Difference]: With dead ends: 219 [2018-10-15 15:36:28,982 INFO L226 Difference]: Without dead ends: 219 [2018-10-15 15:36:28,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:36:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-15 15:36:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2018-10-15 15:36:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-15 15:36:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 216 transitions. [2018-10-15 15:36:28,986 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 216 transitions. Word has length 200 [2018-10-15 15:36:28,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:28,987 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 216 transitions. [2018-10-15 15:36:28,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:36:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 216 transitions. [2018-10-15 15:36:28,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-15 15:36:28,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:28,989 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 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, 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 15:36:28,990 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:28,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:28,990 INFO L82 PathProgramCache]: Analyzing trace with hash -935931468, now seen corresponding path program 9 times [2018-10-15 15:36:28,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 2 proven. 342 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 15:36:29,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:29,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:36:29,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:36:29,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:36:29,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:36:29,494 INFO L87 Difference]: Start difference. First operand 213 states and 216 transitions. Second operand 21 states. [2018-10-15 15:36:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:31,515 INFO L93 Difference]: Finished difference Result 228 states and 231 transitions. [2018-10-15 15:36:31,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 15:36:31,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 209 [2018-10-15 15:36:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:31,518 INFO L225 Difference]: With dead ends: 228 [2018-10-15 15:36:31,518 INFO L226 Difference]: Without dead ends: 228 [2018-10-15 15:36:31,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:36:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-15 15:36:31,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 222. [2018-10-15 15:36:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-15 15:36:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 225 transitions. [2018-10-15 15:36:31,524 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 225 transitions. Word has length 209 [2018-10-15 15:36:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:31,524 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 225 transitions. [2018-10-15 15:36:31,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:36:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 225 transitions. [2018-10-15 15:36:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-15 15:36:31,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:31,526 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 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 15:36:31,526 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:31,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:31,526 INFO L82 PathProgramCache]: Analyzing trace with hash -904762994, now seen corresponding path program 10 times [2018-10-15 15:36:31,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:32,104 WARN L179 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 12 [2018-10-15 15:36:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-10-15 15:36:32,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:36:32,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-15 15:36:32,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:36:32,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:36:32,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:36:32,297 INFO L87 Difference]: Start difference. First operand 222 states and 225 transitions. Second operand 6 states. [2018-10-15 15:36:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:32,449 INFO L93 Difference]: Finished difference Result 234 states and 237 transitions. [2018-10-15 15:36:32,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:36:32,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2018-10-15 15:36:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:32,451 INFO L225 Difference]: With dead ends: 234 [2018-10-15 15:36:32,451 INFO L226 Difference]: Without dead ends: 226 [2018-10-15 15:36:32,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:36:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-15 15:36:32,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2018-10-15 15:36:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 15:36:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 227 transitions. [2018-10-15 15:36:32,456 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 227 transitions. Word has length 218 [2018-10-15 15:36:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:32,456 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 227 transitions. [2018-10-15 15:36:32,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:36:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 227 transitions. [2018-10-15 15:36:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-15 15:36:32,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:32,458 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:32,458 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:32,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:32,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1899675621, now seen corresponding path program 1 times [2018-10-15 15:36:32,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:32,960 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-15 15:36:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:33,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:33,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:36:33,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:36:33,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:36:33,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:36:33,054 INFO L87 Difference]: Start difference. First operand 224 states and 227 transitions. Second operand 7 states. [2018-10-15 15:36:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:33,120 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2018-10-15 15:36:33,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:36:33,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2018-10-15 15:36:33,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:33,125 INFO L225 Difference]: With dead ends: 235 [2018-10-15 15:36:33,125 INFO L226 Difference]: Without dead ends: 231 [2018-10-15 15:36:33,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:36:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-15 15:36:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2018-10-15 15:36:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-15 15:36:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 232 transitions. [2018-10-15 15:36:33,129 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 232 transitions. Word has length 223 [2018-10-15 15:36:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:33,130 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 232 transitions. [2018-10-15 15:36:33,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:36:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 232 transitions. [2018-10-15 15:36:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-15 15:36:33,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:33,131 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 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 15:36:33,132 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:33,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:33,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1481492462, now seen corresponding path program 2 times [2018-10-15 15:36:33,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:34,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:34,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:36:34,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:36:34,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:36:34,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:36:34,245 INFO L87 Difference]: Start difference. First operand 229 states and 232 transitions. Second operand 9 states. [2018-10-15 15:36:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:34,426 INFO L93 Difference]: Finished difference Result 240 states and 243 transitions. [2018-10-15 15:36:34,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:36:34,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 228 [2018-10-15 15:36:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:34,430 INFO L225 Difference]: With dead ends: 240 [2018-10-15 15:36:34,430 INFO L226 Difference]: Without dead ends: 236 [2018-10-15 15:36:34,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:36:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-15 15:36:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2018-10-15 15:36:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-15 15:36:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 237 transitions. [2018-10-15 15:36:34,435 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 237 transitions. Word has length 228 [2018-10-15 15:36:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:34,435 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 237 transitions. [2018-10-15 15:36:34,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:36:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 237 transitions. [2018-10-15 15:36:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-15 15:36:34,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:34,437 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:34,437 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:34,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:34,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1690608251, now seen corresponding path program 3 times [2018-10-15 15:36:34,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:35,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:35,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:36:35,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:36:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:36:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:36:35,307 INFO L87 Difference]: Start difference. First operand 234 states and 237 transitions. Second operand 11 states. [2018-10-15 15:36:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:35,849 INFO L93 Difference]: Finished difference Result 245 states and 248 transitions. [2018-10-15 15:36:35,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:36:35,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2018-10-15 15:36:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:35,851 INFO L225 Difference]: With dead ends: 245 [2018-10-15 15:36:35,851 INFO L226 Difference]: Without dead ends: 241 [2018-10-15 15:36:35,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:36:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-15 15:36:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2018-10-15 15:36:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-15 15:36:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 242 transitions. [2018-10-15 15:36:35,856 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 242 transitions. Word has length 233 [2018-10-15 15:36:35,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:35,856 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 242 transitions. [2018-10-15 15:36:35,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:36:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 242 transitions. [2018-10-15 15:36:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-15 15:36:35,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:35,859 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:35,859 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:35,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:35,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1747889742, now seen corresponding path program 4 times [2018-10-15 15:36:35,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:36,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:36,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:36:36,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:36:36,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:36:36,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:36:36,184 INFO L87 Difference]: Start difference. First operand 239 states and 242 transitions. Second operand 13 states. [2018-10-15 15:36:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:36,431 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2018-10-15 15:36:36,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:36:36,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 238 [2018-10-15 15:36:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:36,434 INFO L225 Difference]: With dead ends: 250 [2018-10-15 15:36:36,434 INFO L226 Difference]: Without dead ends: 246 [2018-10-15 15:36:36,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-10-15 15:36:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-15 15:36:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2018-10-15 15:36:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-15 15:36:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 247 transitions. [2018-10-15 15:36:36,439 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 247 transitions. Word has length 238 [2018-10-15 15:36:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:36,440 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 247 transitions. [2018-10-15 15:36:36,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:36:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 247 transitions. [2018-10-15 15:36:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-15 15:36:36,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:36,441 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:36,442 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:36,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:36,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1781828827, now seen corresponding path program 5 times [2018-10-15 15:36:36,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:37,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:37,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:36:37,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:36:37,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:36:37,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:36:37,272 INFO L87 Difference]: Start difference. First operand 244 states and 247 transitions. Second operand 15 states. [2018-10-15 15:36:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:37,633 INFO L93 Difference]: Finished difference Result 255 states and 258 transitions. [2018-10-15 15:36:37,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 15:36:37,634 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 243 [2018-10-15 15:36:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:37,636 INFO L225 Difference]: With dead ends: 255 [2018-10-15 15:36:37,637 INFO L226 Difference]: Without dead ends: 251 [2018-10-15 15:36:37,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2018-10-15 15:36:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-15 15:36:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-10-15 15:36:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-15 15:36:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 252 transitions. [2018-10-15 15:36:37,641 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 252 transitions. Word has length 243 [2018-10-15 15:36:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:37,642 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 252 transitions. [2018-10-15 15:36:37,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:36:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 252 transitions. [2018-10-15 15:36:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-15 15:36:37,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:37,644 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:37,644 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:37,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:37,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1852513454, now seen corresponding path program 6 times [2018-10-15 15:36:37,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:38,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:38,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:36:38,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:36:38,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:36:38,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:36:38,790 INFO L87 Difference]: Start difference. First operand 249 states and 252 transitions. Second operand 17 states. [2018-10-15 15:36:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:39,346 INFO L93 Difference]: Finished difference Result 260 states and 263 transitions. [2018-10-15 15:36:39,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 15:36:39,353 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 248 [2018-10-15 15:36:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:39,354 INFO L225 Difference]: With dead ends: 260 [2018-10-15 15:36:39,354 INFO L226 Difference]: Without dead ends: 256 [2018-10-15 15:36:39,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:36:39,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-15 15:36:39,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2018-10-15 15:36:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 15:36:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 257 transitions. [2018-10-15 15:36:39,359 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 257 transitions. Word has length 248 [2018-10-15 15:36:39,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:39,360 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 257 transitions. [2018-10-15 15:36:39,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:36:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 257 transitions. [2018-10-15 15:36:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 15:36:39,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:39,362 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:39,362 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:39,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:39,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1844773061, now seen corresponding path program 7 times [2018-10-15 15:36:39,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:40,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:40,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:36:40,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:36:40,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:36:40,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:36:40,425 INFO L87 Difference]: Start difference. First operand 254 states and 257 transitions. Second operand 19 states. [2018-10-15 15:36:41,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:41,227 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2018-10-15 15:36:41,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 15:36:41,227 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 253 [2018-10-15 15:36:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:41,229 INFO L225 Difference]: With dead ends: 265 [2018-10-15 15:36:41,229 INFO L226 Difference]: Without dead ends: 261 [2018-10-15 15:36:41,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:36:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-15 15:36:41,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2018-10-15 15:36:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 15:36:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 262 transitions. [2018-10-15 15:36:41,232 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 262 transitions. Word has length 253 [2018-10-15 15:36:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:41,233 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 262 transitions. [2018-10-15 15:36:41,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:36:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 262 transitions. [2018-10-15 15:36:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-15 15:36:41,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:41,235 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:41,235 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:41,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:41,235 INFO L82 PathProgramCache]: Analyzing trace with hash -197586162, now seen corresponding path program 8 times [2018-10-15 15:36:41,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:41,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:41,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:36:41,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:36:41,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:36:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:36:41,768 INFO L87 Difference]: Start difference. First operand 259 states and 262 transitions. Second operand 21 states. [2018-10-15 15:36:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:42,515 INFO L93 Difference]: Finished difference Result 270 states and 273 transitions. [2018-10-15 15:36:42,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 15:36:42,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 258 [2018-10-15 15:36:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:42,518 INFO L225 Difference]: With dead ends: 270 [2018-10-15 15:36:42,518 INFO L226 Difference]: Without dead ends: 266 [2018-10-15 15:36:42,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=1295, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 15:36:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-15 15:36:42,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-10-15 15:36:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-15 15:36:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 267 transitions. [2018-10-15 15:36:42,523 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 267 transitions. Word has length 258 [2018-10-15 15:36:42,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:42,523 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 267 transitions. [2018-10-15 15:36:42,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:36:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 267 transitions. [2018-10-15 15:36:42,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-15 15:36:42,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:42,525 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:42,525 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:42,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:42,525 INFO L82 PathProgramCache]: Analyzing trace with hash -331217307, now seen corresponding path program 9 times [2018-10-15 15:36:42,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:42,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:42,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 15:36:42,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 15:36:42,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 15:36:42,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:36:42,978 INFO L87 Difference]: Start difference. First operand 264 states and 267 transitions. Second operand 23 states. [2018-10-15 15:36:43,684 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 15:36:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:44,499 INFO L93 Difference]: Finished difference Result 275 states and 278 transitions. [2018-10-15 15:36:44,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 15:36:44,500 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 263 [2018-10-15 15:36:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:44,502 INFO L225 Difference]: With dead ends: 275 [2018-10-15 15:36:44,502 INFO L226 Difference]: Without dead ends: 271 [2018-10-15 15:36:44,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=1599, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 15:36:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-15 15:36:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-10-15 15:36:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-15 15:36:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 272 transitions. [2018-10-15 15:36:44,507 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 272 transitions. Word has length 263 [2018-10-15 15:36:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:44,508 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 272 transitions. [2018-10-15 15:36:44,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 15:36:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 272 transitions. [2018-10-15 15:36:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-15 15:36:44,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:44,509 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:44,510 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:44,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash -145845906, now seen corresponding path program 10 times [2018-10-15 15:36:44,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:46,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:46,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 15:36:46,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 15:36:46,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 15:36:46,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:36:46,093 INFO L87 Difference]: Start difference. First operand 269 states and 272 transitions. Second operand 25 states. [2018-10-15 15:36:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:47,160 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2018-10-15 15:36:47,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 15:36:47,167 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 268 [2018-10-15 15:36:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:47,168 INFO L225 Difference]: With dead ends: 280 [2018-10-15 15:36:47,168 INFO L226 Difference]: Without dead ends: 276 [2018-10-15 15:36:47,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 15:36:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-15 15:36:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2018-10-15 15:36:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-15 15:36:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 277 transitions. [2018-10-15 15:36:47,172 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 277 transitions. Word has length 268 [2018-10-15 15:36:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:47,173 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 277 transitions. [2018-10-15 15:36:47,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 15:36:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 277 transitions. [2018-10-15 15:36:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-15 15:36:47,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:47,174 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:47,175 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:47,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:47,175 INFO L82 PathProgramCache]: Analyzing trace with hash 884769797, now seen corresponding path program 11 times [2018-10-15 15:36:47,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:48,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:48,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:36:48,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:36:48,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:36:48,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:36:48,469 INFO L87 Difference]: Start difference. First operand 274 states and 277 transitions. Second operand 27 states. [2018-10-15 15:36:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:49,698 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2018-10-15 15:36:49,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 15:36:49,699 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 273 [2018-10-15 15:36:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:49,700 INFO L225 Difference]: With dead ends: 285 [2018-10-15 15:36:49,700 INFO L226 Difference]: Without dead ends: 281 [2018-10-15 15:36:49,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=2303, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 15:36:49,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-15 15:36:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2018-10-15 15:36:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-15 15:36:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 282 transitions. [2018-10-15 15:36:49,705 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 282 transitions. Word has length 273 [2018-10-15 15:36:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:49,705 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 282 transitions. [2018-10-15 15:36:49,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:36:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 282 transitions. [2018-10-15 15:36:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-15 15:36:49,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:49,708 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:49,708 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:49,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1239521230, now seen corresponding path program 12 times [2018-10-15 15:36:49,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:50,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:50,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 15:36:50,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 15:36:50,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 15:36:50,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:36:50,650 INFO L87 Difference]: Start difference. First operand 279 states and 282 transitions. Second operand 29 states. [2018-10-15 15:36:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:52,460 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2018-10-15 15:36:52,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 15:36:52,461 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 278 [2018-10-15 15:36:52,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:52,462 INFO L225 Difference]: With dead ends: 290 [2018-10-15 15:36:52,463 INFO L226 Difference]: Without dead ends: 286 [2018-10-15 15:36:52,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=2703, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 15:36:52,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-15 15:36:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-10-15 15:36:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 15:36:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 287 transitions. [2018-10-15 15:36:52,476 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 287 transitions. Word has length 278 [2018-10-15 15:36:52,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:52,477 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 287 transitions. [2018-10-15 15:36:52,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 15:36:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 287 transitions. [2018-10-15 15:36:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-15 15:36:52,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:52,479 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:52,480 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:52,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:52,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1726904741, now seen corresponding path program 13 times [2018-10-15 15:36:52,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:54,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:54,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:54,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 15:36:54,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 15:36:54,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 15:36:54,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:36:54,626 INFO L87 Difference]: Start difference. First operand 284 states and 287 transitions. Second operand 31 states. [2018-10-15 15:36:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:56,111 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2018-10-15 15:36:56,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 15:36:56,111 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 283 [2018-10-15 15:36:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:56,112 INFO L225 Difference]: With dead ends: 295 [2018-10-15 15:36:56,113 INFO L226 Difference]: Without dead ends: 291 [2018-10-15 15:36:56,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=171, Invalid=3135, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 15:36:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-15 15:36:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2018-10-15 15:36:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-15 15:36:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2018-10-15 15:36:56,118 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 283 [2018-10-15 15:36:56,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:56,118 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2018-10-15 15:36:56,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 15:36:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2018-10-15 15:36:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-15 15:36:56,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:56,120 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:56,120 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:56,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:56,121 INFO L82 PathProgramCache]: Analyzing trace with hash -223861202, now seen corresponding path program 14 times [2018-10-15 15:36:56,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:36:57,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:57,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:36:57,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:36:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:36:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:36:57,272 INFO L87 Difference]: Start difference. First operand 289 states and 292 transitions. Second operand 33 states. [2018-10-15 15:36:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:59,443 INFO L93 Difference]: Finished difference Result 300 states and 303 transitions. [2018-10-15 15:36:59,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 15:36:59,444 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 288 [2018-10-15 15:36:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:59,445 INFO L225 Difference]: With dead ends: 300 [2018-10-15 15:36:59,445 INFO L226 Difference]: Without dead ends: 296 [2018-10-15 15:36:59,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=183, Invalid=3599, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 15:36:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-15 15:36:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2018-10-15 15:36:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-15 15:36:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 297 transitions. [2018-10-15 15:36:59,450 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 297 transitions. Word has length 288 [2018-10-15 15:36:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:59,450 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 297 transitions. [2018-10-15 15:36:59,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:36:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 297 transitions. [2018-10-15 15:36:59,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-15 15:36:59,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:59,452 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:59,453 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:59,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:59,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1038214981, now seen corresponding path program 15 times [2018-10-15 15:36:59,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:37:00,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:00,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 15:37:00,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 15:37:00,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 15:37:00,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:37:00,343 INFO L87 Difference]: Start difference. First operand 294 states and 297 transitions. Second operand 35 states. [2018-10-15 15:37:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:02,573 INFO L93 Difference]: Finished difference Result 305 states and 308 transitions. [2018-10-15 15:37:02,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 15:37:02,574 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 293 [2018-10-15 15:37:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:02,575 INFO L225 Difference]: With dead ends: 305 [2018-10-15 15:37:02,575 INFO L226 Difference]: Without dead ends: 301 [2018-10-15 15:37:02,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=195, Invalid=4095, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 15:37:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-15 15:37:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2018-10-15 15:37:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-15 15:37:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 302 transitions. [2018-10-15 15:37:02,580 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 302 transitions. Word has length 293 [2018-10-15 15:37:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:02,580 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 302 transitions. [2018-10-15 15:37:02,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 15:37:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 302 transitions. [2018-10-15 15:37:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 15:37:02,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:02,582 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:02,582 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:02,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1931985778, now seen corresponding path program 16 times [2018-10-15 15:37:02,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1439 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:37:03,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:03,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 15:37:03,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 15:37:03,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 15:37:03,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:37:03,547 INFO L87 Difference]: Start difference. First operand 299 states and 302 transitions. Second operand 37 states. [2018-10-15 15:37:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:06,050 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2018-10-15 15:37:06,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 15:37:06,051 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 298 [2018-10-15 15:37:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:06,053 INFO L225 Difference]: With dead ends: 310 [2018-10-15 15:37:06,053 INFO L226 Difference]: Without dead ends: 306 [2018-10-15 15:37:06,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=207, Invalid=4623, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 15:37:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-15 15:37:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-10-15 15:37:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-15 15:37:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 307 transitions. [2018-10-15 15:37:06,059 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 307 transitions. Word has length 298 [2018-10-15 15:37:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:06,060 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 307 transitions. [2018-10-15 15:37:06,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 15:37:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 307 transitions. [2018-10-15 15:37:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-15 15:37:06,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:06,062 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:06,062 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:06,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:06,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1340027675, now seen corresponding path program 17 times [2018-10-15 15:37:06,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:37:07,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:07,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:37:07,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:37:07,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:37:07,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:37:07,265 INFO L87 Difference]: Start difference. First operand 304 states and 307 transitions. Second operand 39 states. [2018-10-15 15:37:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:09,636 INFO L93 Difference]: Finished difference Result 315 states and 318 transitions. [2018-10-15 15:37:09,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 15:37:09,637 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 303 [2018-10-15 15:37:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:09,639 INFO L225 Difference]: With dead ends: 315 [2018-10-15 15:37:09,639 INFO L226 Difference]: Without dead ends: 311 [2018-10-15 15:37:09,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=5183, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 15:37:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-15 15:37:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2018-10-15 15:37:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-15 15:37:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 312 transitions. [2018-10-15 15:37:09,645 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 312 transitions. Word has length 303 [2018-10-15 15:37:09,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:09,645 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 312 transitions. [2018-10-15 15:37:09,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:37:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 312 transitions. [2018-10-15 15:37:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-15 15:37:09,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:09,647 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:09,647 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:09,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:09,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1473783058, now seen corresponding path program 18 times [2018-10-15 15:37:09,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:37:10,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:10,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 15:37:10,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 15:37:10,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 15:37:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1559, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:37:10,768 INFO L87 Difference]: Start difference. First operand 309 states and 312 transitions. Second operand 41 states. [2018-10-15 15:37:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:13,682 INFO L93 Difference]: Finished difference Result 320 states and 323 transitions. [2018-10-15 15:37:13,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 15:37:13,683 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 308 [2018-10-15 15:37:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:13,684 INFO L225 Difference]: With dead ends: 320 [2018-10-15 15:37:13,684 INFO L226 Difference]: Without dead ends: 316 [2018-10-15 15:37:13,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=231, Invalid=5775, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 15:37:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-15 15:37:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 314. [2018-10-15 15:37:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-15 15:37:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 317 transitions. [2018-10-15 15:37:13,689 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 317 transitions. Word has length 308 [2018-10-15 15:37:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:13,689 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 317 transitions. [2018-10-15 15:37:13,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 15:37:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 317 transitions. [2018-10-15 15:37:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-15 15:37:13,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:13,691 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:13,692 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:13,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:13,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1883952507, now seen corresponding path program 19 times [2018-10-15 15:37:13,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1700 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:37:14,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:14,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:37:14,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:37:14,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:37:14,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:37:14,961 INFO L87 Difference]: Start difference. First operand 314 states and 317 transitions. Second operand 43 states. [2018-10-15 15:37:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:18,229 INFO L93 Difference]: Finished difference Result 325 states and 328 transitions. [2018-10-15 15:37:18,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 15:37:18,230 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 313 [2018-10-15 15:37:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:18,231 INFO L225 Difference]: With dead ends: 325 [2018-10-15 15:37:18,231 INFO L226 Difference]: Without dead ends: 321 [2018-10-15 15:37:18,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=243, Invalid=6399, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 15:37:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-15 15:37:18,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2018-10-15 15:37:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-15 15:37:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 322 transitions. [2018-10-15 15:37:18,236 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 322 transitions. Word has length 313 [2018-10-15 15:37:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:18,236 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 322 transitions. [2018-10-15 15:37:18,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:37:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 322 transitions. [2018-10-15 15:37:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-15 15:37:18,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:18,237 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:18,237 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:18,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:18,238 INFO L82 PathProgramCache]: Analyzing trace with hash 684523854, now seen corresponding path program 20 times [2018-10-15 15:37:18,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1797 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:37:19,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:19,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:37:19,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:37:19,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:37:19,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:37:19,441 INFO L87 Difference]: Start difference. First operand 319 states and 322 transitions. Second operand 45 states. [2018-10-15 15:37:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:22,902 INFO L93 Difference]: Finished difference Result 330 states and 333 transitions. [2018-10-15 15:37:22,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 15:37:22,903 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 318 [2018-10-15 15:37:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:22,905 INFO L225 Difference]: With dead ends: 330 [2018-10-15 15:37:22,905 INFO L226 Difference]: Without dead ends: 326 [2018-10-15 15:37:22,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=255, Invalid=7055, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 15:37:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-15 15:37:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2018-10-15 15:37:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-15 15:37:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 327 transitions. [2018-10-15 15:37:22,910 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 327 transitions. Word has length 318 [2018-10-15 15:37:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:22,911 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 327 transitions. [2018-10-15 15:37:22,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:37:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 327 transitions. [2018-10-15 15:37:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-15 15:37:22,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:22,913 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:22,913 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:22,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:22,913 INFO L82 PathProgramCache]: Analyzing trace with hash 707330085, now seen corresponding path program 21 times [2018-10-15 15:37:22,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:37:24,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:24,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:37:24,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:37:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:37:24,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2069, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:37:24,183 INFO L87 Difference]: Start difference. First operand 324 states and 327 transitions. Second operand 47 states. [2018-10-15 15:37:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:27,955 INFO L93 Difference]: Finished difference Result 335 states and 338 transitions. [2018-10-15 15:37:27,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 15:37:27,955 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 323 [2018-10-15 15:37:27,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:27,956 INFO L225 Difference]: With dead ends: 335 [2018-10-15 15:37:27,956 INFO L226 Difference]: Without dead ends: 331 [2018-10-15 15:37:27,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=267, Invalid=7743, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:37:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-15 15:37:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2018-10-15 15:37:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-15 15:37:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 332 transitions. [2018-10-15 15:37:27,960 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 332 transitions. Word has length 323 [2018-10-15 15:37:27,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:27,961 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 332 transitions. [2018-10-15 15:37:27,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:37:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 332 transitions. [2018-10-15 15:37:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-15 15:37:27,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:27,963 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:27,963 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:27,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:27,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1484935250, now seen corresponding path program 22 times [2018-10-15 15:37:27,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2006 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:37:29,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:29,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 15:37:29,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 15:37:29,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 15:37:29,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:37:29,491 INFO L87 Difference]: Start difference. First operand 329 states and 332 transitions. Second operand 49 states. [2018-10-15 15:37:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:33,527 INFO L93 Difference]: Finished difference Result 340 states and 343 transitions. [2018-10-15 15:37:33,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 15:37:33,528 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 328 [2018-10-15 15:37:33,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:33,529 INFO L225 Difference]: With dead ends: 340 [2018-10-15 15:37:33,529 INFO L226 Difference]: Without dead ends: 336 [2018-10-15 15:37:33,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=279, Invalid=8463, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 15:37:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-15 15:37:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2018-10-15 15:37:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-15 15:37:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 337 transitions. [2018-10-15 15:37:33,535 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 337 transitions. Word has length 328 [2018-10-15 15:37:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:33,535 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 337 transitions. [2018-10-15 15:37:33,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 15:37:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 337 transitions. [2018-10-15 15:37:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-15 15:37:33,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:33,537 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:33,537 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:33,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:33,538 INFO L82 PathProgramCache]: Analyzing trace with hash -393851451, now seen corresponding path program 23 times [2018-10-15 15:37:33,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2118 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:37:35,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:35,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:37:35,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:37:35,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:37:35,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2449, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:37:35,055 INFO L87 Difference]: Start difference. First operand 334 states and 337 transitions. Second operand 51 states. [2018-10-15 15:37:39,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:39,355 INFO L93 Difference]: Finished difference Result 345 states and 348 transitions. [2018-10-15 15:37:39,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 15:37:39,355 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 333 [2018-10-15 15:37:39,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:39,357 INFO L225 Difference]: With dead ends: 345 [2018-10-15 15:37:39,357 INFO L226 Difference]: Without dead ends: 341 [2018-10-15 15:37:39,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=291, Invalid=9215, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 15:37:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-15 15:37:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2018-10-15 15:37:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-15 15:37:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 342 transitions. [2018-10-15 15:37:39,362 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 342 transitions. Word has length 333 [2018-10-15 15:37:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:39,362 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 342 transitions. [2018-10-15 15:37:39,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:37:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 342 transitions. [2018-10-15 15:37:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-15 15:37:39,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:39,364 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:39,364 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:39,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash -781195762, now seen corresponding path program 24 times [2018-10-15 15:37:39,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:37:40,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:40,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 15:37:40,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 15:37:40,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 15:37:40,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2651, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:37:40,896 INFO L87 Difference]: Start difference. First operand 339 states and 342 transitions. Second operand 53 states. [2018-10-15 15:37:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:45,639 INFO L93 Difference]: Finished difference Result 350 states and 353 transitions. [2018-10-15 15:37:45,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 15:37:45,639 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 338 [2018-10-15 15:37:45,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:45,641 INFO L225 Difference]: With dead ends: 350 [2018-10-15 15:37:45,641 INFO L226 Difference]: Without dead ends: 346 [2018-10-15 15:37:45,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=303, Invalid=9999, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 15:37:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-15 15:37:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2018-10-15 15:37:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 15:37:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 347 transitions. [2018-10-15 15:37:45,645 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 347 transitions. Word has length 338 [2018-10-15 15:37:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:45,646 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 347 transitions. [2018-10-15 15:37:45,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 15:37:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 347 transitions. [2018-10-15 15:37:45,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-15 15:37:45,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:45,648 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:45,648 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:45,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:45,648 INFO L82 PathProgramCache]: Analyzing trace with hash -279506075, now seen corresponding path program 25 times [2018-10-15 15:37:45,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2357 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:37:47,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:47,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 15:37:47,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 15:37:47,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 15:37:47,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:37:47,493 INFO L87 Difference]: Start difference. First operand 344 states and 347 transitions. Second operand 55 states. [2018-10-15 15:37:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:52,349 INFO L93 Difference]: Finished difference Result 355 states and 358 transitions. [2018-10-15 15:37:52,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 15:37:52,357 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 343 [2018-10-15 15:37:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:52,359 INFO L225 Difference]: With dead ends: 355 [2018-10-15 15:37:52,359 INFO L226 Difference]: Without dead ends: 351 [2018-10-15 15:37:52,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=315, Invalid=10815, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 15:37:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-15 15:37:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-15 15:37:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-15 15:37:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 352 transitions. [2018-10-15 15:37:52,363 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 352 transitions. Word has length 343 [2018-10-15 15:37:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:52,364 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 352 transitions. [2018-10-15 15:37:52,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 15:37:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 352 transitions. [2018-10-15 15:37:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 15:37:52,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:52,366 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:52,366 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:52,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:52,367 INFO L82 PathProgramCache]: Analyzing trace with hash -933649298, now seen corresponding path program 26 times [2018-10-15 15:37:52,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2484 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:37:54,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:54,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:37:54,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:37:54,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:37:54,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:37:54,357 INFO L87 Difference]: Start difference. First operand 349 states and 352 transitions. Second operand 57 states. [2018-10-15 15:37:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:59,774 INFO L93 Difference]: Finished difference Result 360 states and 363 transitions. [2018-10-15 15:37:59,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 15:37:59,774 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 348 [2018-10-15 15:37:59,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:59,776 INFO L225 Difference]: With dead ends: 360 [2018-10-15 15:37:59,776 INFO L226 Difference]: Without dead ends: 356 [2018-10-15 15:37:59,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=327, Invalid=11663, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 15:37:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-15 15:37:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2018-10-15 15:37:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-15 15:37:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 357 transitions. [2018-10-15 15:37:59,779 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 357 transitions. Word has length 348 [2018-10-15 15:37:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:59,780 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 357 transitions. [2018-10-15 15:37:59,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:37:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 357 transitions. [2018-10-15 15:37:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-10-15 15:37:59,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:59,781 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:59,782 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:59,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:59,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1096462075, now seen corresponding path program 27 times [2018-10-15 15:37:59,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2616 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:38:01,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:01,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 15:38:01,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 15:38:01,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 15:38:01,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3305, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:38:01,919 INFO L87 Difference]: Start difference. First operand 354 states and 357 transitions. Second operand 59 states. [2018-10-15 15:38:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:07,735 INFO L93 Difference]: Finished difference Result 365 states and 368 transitions. [2018-10-15 15:38:07,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 15:38:07,736 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 353 [2018-10-15 15:38:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:07,737 INFO L225 Difference]: With dead ends: 365 [2018-10-15 15:38:07,737 INFO L226 Difference]: Without dead ends: 361 [2018-10-15 15:38:07,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=339, Invalid=12543, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 15:38:07,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-15 15:38:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 359. [2018-10-15 15:38:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-15 15:38:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 362 transitions. [2018-10-15 15:38:07,742 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 362 transitions. Word has length 353 [2018-10-15 15:38:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:07,742 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 362 transitions. [2018-10-15 15:38:07,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 15:38:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 362 transitions. [2018-10-15 15:38:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-15 15:38:07,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:07,744 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:07,744 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:07,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:07,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2106529074, now seen corresponding path program 28 times [2018-10-15 15:38:07,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:38:10,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:10,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 15:38:10,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 15:38:10,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 15:38:10,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3539, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:38:10,090 INFO L87 Difference]: Start difference. First operand 359 states and 362 transitions. Second operand 61 states. [2018-10-15 15:38:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:16,202 INFO L93 Difference]: Finished difference Result 370 states and 373 transitions. [2018-10-15 15:38:16,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 15:38:16,202 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 358 [2018-10-15 15:38:16,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:16,204 INFO L225 Difference]: With dead ends: 370 [2018-10-15 15:38:16,204 INFO L226 Difference]: Without dead ends: 366 [2018-10-15 15:38:16,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=351, Invalid=13455, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 15:38:16,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-10-15 15:38:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2018-10-15 15:38:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-15 15:38:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 367 transitions. [2018-10-15 15:38:16,208 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 367 transitions. Word has length 358 [2018-10-15 15:38:16,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:16,208 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 367 transitions. [2018-10-15 15:38:16,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 15:38:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 367 transitions. [2018-10-15 15:38:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-15 15:38:16,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:16,211 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:16,211 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:16,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:16,211 INFO L82 PathProgramCache]: Analyzing trace with hash -772077915, now seen corresponding path program 29 times [2018-10-15 15:38:16,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2895 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:38:18,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:18,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:38:18,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:38:18,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:38:18,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3781, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:38:18,988 INFO L87 Difference]: Start difference. First operand 364 states and 367 transitions. Second operand 63 states. [2018-10-15 15:38:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:25,712 INFO L93 Difference]: Finished difference Result 375 states and 378 transitions. [2018-10-15 15:38:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 15:38:25,712 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 363 [2018-10-15 15:38:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:25,713 INFO L225 Difference]: With dead ends: 375 [2018-10-15 15:38:25,714 INFO L226 Difference]: Without dead ends: 371 [2018-10-15 15:38:25,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1769 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=363, Invalid=14399, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 15:38:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-15 15:38:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2018-10-15 15:38:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-15 15:38:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 372 transitions. [2018-10-15 15:38:25,719 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 372 transitions. Word has length 363 [2018-10-15 15:38:25,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:25,720 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 372 transitions. [2018-10-15 15:38:25,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:38:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 372 transitions. [2018-10-15 15:38:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-15 15:38:25,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:25,722 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:25,722 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:25,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:25,722 INFO L82 PathProgramCache]: Analyzing trace with hash 711702830, now seen corresponding path program 30 times [2018-10-15 15:38:25,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:38:27,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:27,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 15:38:27,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 15:38:27,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 15:38:27,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4031, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:38:27,951 INFO L87 Difference]: Start difference. First operand 369 states and 372 transitions. Second operand 65 states. [2018-10-15 15:38:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:34,963 INFO L93 Difference]: Finished difference Result 380 states and 383 transitions. [2018-10-15 15:38:34,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 15:38:34,963 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 368 [2018-10-15 15:38:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:34,965 INFO L225 Difference]: With dead ends: 380 [2018-10-15 15:38:34,965 INFO L226 Difference]: Without dead ends: 376 [2018-10-15 15:38:34,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=375, Invalid=15375, Unknown=0, NotChecked=0, Total=15750 [2018-10-15 15:38:34,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-15 15:38:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2018-10-15 15:38:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 15:38:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 377 transitions. [2018-10-15 15:38:34,969 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 377 transitions. Word has length 368 [2018-10-15 15:38:34,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:34,970 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 377 transitions. [2018-10-15 15:38:34,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 15:38:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 377 transitions. [2018-10-15 15:38:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-15 15:38:34,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:34,972 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:34,973 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:34,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:34,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1080177733, now seen corresponding path program 31 times [2018-10-15 15:38:34,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3194 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:38:37,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:37,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:38:37,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:38:37,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:38:37,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4289, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:38:37,281 INFO L87 Difference]: Start difference. First operand 374 states and 377 transitions. Second operand 67 states. [2018-10-15 15:38:44,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:44,803 INFO L93 Difference]: Finished difference Result 385 states and 388 transitions. [2018-10-15 15:38:44,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 15:38:44,803 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 373 [2018-10-15 15:38:44,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:44,805 INFO L225 Difference]: With dead ends: 385 [2018-10-15 15:38:44,805 INFO L226 Difference]: Without dead ends: 381 [2018-10-15 15:38:44,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=387, Invalid=16383, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 15:38:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-15 15:38:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 379. [2018-10-15 15:38:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-15 15:38:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 382 transitions. [2018-10-15 15:38:44,809 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 382 transitions. Word has length 373 [2018-10-15 15:38:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:44,809 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 382 transitions. [2018-10-15 15:38:44,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:38:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 382 transitions. [2018-10-15 15:38:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-15 15:38:44,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:44,811 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:44,811 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:44,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:44,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2139099022, now seen corresponding path program 32 times [2018-10-15 15:38:44,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3351 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:38:47,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:47,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:38:47,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:38:47,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:38:47,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4555, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:38:47,241 INFO L87 Difference]: Start difference. First operand 379 states and 382 transitions. Second operand 69 states. [2018-10-15 15:38:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:55,285 INFO L93 Difference]: Finished difference Result 390 states and 393 transitions. [2018-10-15 15:38:55,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-15 15:38:55,285 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 378 [2018-10-15 15:38:55,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:55,286 INFO L225 Difference]: With dead ends: 390 [2018-10-15 15:38:55,286 INFO L226 Difference]: Without dead ends: 386 [2018-10-15 15:38:55,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=399, Invalid=17423, Unknown=0, NotChecked=0, Total=17822 [2018-10-15 15:38:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-15 15:38:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 384. [2018-10-15 15:38:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-10-15 15:38:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 387 transitions. [2018-10-15 15:38:55,290 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 387 transitions. Word has length 378 [2018-10-15 15:38:55,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:55,291 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 387 transitions. [2018-10-15 15:38:55,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:38:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 387 transitions. [2018-10-15 15:38:55,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-15 15:38:55,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:55,292 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:55,293 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:55,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:55,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1550113253, now seen corresponding path program 33 times [2018-10-15 15:38:55,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3513 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:38:57,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:57,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 15:38:57,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 15:38:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 15:38:57,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4829, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:38:57,902 INFO L87 Difference]: Start difference. First operand 384 states and 387 transitions. Second operand 71 states. [2018-10-15 15:39:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:06,423 INFO L93 Difference]: Finished difference Result 395 states and 398 transitions. [2018-10-15 15:39:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 15:39:06,424 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 383 [2018-10-15 15:39:06,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:06,425 INFO L225 Difference]: With dead ends: 395 [2018-10-15 15:39:06,425 INFO L226 Difference]: Without dead ends: 391 [2018-10-15 15:39:06,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=411, Invalid=18495, Unknown=0, NotChecked=0, Total=18906 [2018-10-15 15:39:06,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-15 15:39:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2018-10-15 15:39:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-15 15:39:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 392 transitions. [2018-10-15 15:39:06,429 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 392 transitions. Word has length 383 [2018-10-15 15:39:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:06,429 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 392 transitions. [2018-10-15 15:39:06,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 15:39:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 392 transitions. [2018-10-15 15:39:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-15 15:39:06,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:06,431 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:06,431 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:06,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:06,431 INFO L82 PathProgramCache]: Analyzing trace with hash 895741422, now seen corresponding path program 34 times [2018-10-15 15:39:06,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3680 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:39:09,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:09,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 15:39:09,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 15:39:09,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 15:39:09,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5111, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:39:09,128 INFO L87 Difference]: Start difference. First operand 389 states and 392 transitions. Second operand 73 states. [2018-10-15 15:39:17,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:17,819 INFO L93 Difference]: Finished difference Result 400 states and 403 transitions. [2018-10-15 15:39:17,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-15 15:39:17,820 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 388 [2018-10-15 15:39:17,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:17,821 INFO L225 Difference]: With dead ends: 400 [2018-10-15 15:39:17,821 INFO L226 Difference]: Without dead ends: 396 [2018-10-15 15:39:17,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2414 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=423, Invalid=19599, Unknown=0, NotChecked=0, Total=20022 [2018-10-15 15:39:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-15 15:39:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394. [2018-10-15 15:39:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-15 15:39:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 397 transitions. [2018-10-15 15:39:17,825 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 397 transitions. Word has length 388 [2018-10-15 15:39:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:17,825 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 397 transitions. [2018-10-15 15:39:17,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 15:39:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 397 transitions. [2018-10-15 15:39:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-10-15 15:39:17,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:17,827 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:17,827 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:17,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:17,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1410135941, now seen corresponding path program 35 times [2018-10-15 15:39:17,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:39:21,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:21,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:39:21,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:39:21,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:39:21,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5401, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:39:21,410 INFO L87 Difference]: Start difference. First operand 394 states and 397 transitions. Second operand 75 states. [2018-10-15 15:39:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:30,677 INFO L93 Difference]: Finished difference Result 405 states and 408 transitions. [2018-10-15 15:39:30,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-15 15:39:30,677 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 393 [2018-10-15 15:39:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:30,679 INFO L225 Difference]: With dead ends: 405 [2018-10-15 15:39:30,679 INFO L226 Difference]: Without dead ends: 401 [2018-10-15 15:39:30,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=435, Invalid=20735, Unknown=0, NotChecked=0, Total=21170 [2018-10-15 15:39:30,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-15 15:39:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 399. [2018-10-15 15:39:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-15 15:39:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 402 transitions. [2018-10-15 15:39:30,682 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 402 transitions. Word has length 393 [2018-10-15 15:39:30,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:30,683 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 402 transitions. [2018-10-15 15:39:30,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:39:30,683 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 402 transitions. [2018-10-15 15:39:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-15 15:39:30,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:30,684 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:30,685 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:30,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:30,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1414353998, now seen corresponding path program 36 times [2018-10-15 15:39:30,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4029 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:39:33,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:33,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 15:39:33,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 15:39:33,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 15:39:33,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5699, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:39:33,744 INFO L87 Difference]: Start difference. First operand 399 states and 402 transitions. Second operand 77 states. [2018-10-15 15:39:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:43,655 INFO L93 Difference]: Finished difference Result 410 states and 413 transitions. [2018-10-15 15:39:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-15 15:39:43,656 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 398 [2018-10-15 15:39:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:43,657 INFO L225 Difference]: With dead ends: 410 [2018-10-15 15:39:43,657 INFO L226 Difference]: Without dead ends: 406 [2018-10-15 15:39:43,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2700 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=447, Invalid=21903, Unknown=0, NotChecked=0, Total=22350 [2018-10-15 15:39:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-15 15:39:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2018-10-15 15:39:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-15 15:39:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 407 transitions. [2018-10-15 15:39:43,661 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 407 transitions. Word has length 398 [2018-10-15 15:39:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:43,661 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 407 transitions. [2018-10-15 15:39:43,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 15:39:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 407 transitions. [2018-10-15 15:39:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-10-15 15:39:43,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:43,663 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:43,663 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:43,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:43,664 INFO L82 PathProgramCache]: Analyzing trace with hash -790328027, now seen corresponding path program 37 times [2018-10-15 15:39:43,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4211 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:39:47,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:47,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 15:39:47,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 15:39:47,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 15:39:47,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6005, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:39:47,112 INFO L87 Difference]: Start difference. First operand 404 states and 407 transitions. Second operand 79 states. [2018-10-15 15:39:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:57,577 INFO L93 Difference]: Finished difference Result 415 states and 418 transitions. [2018-10-15 15:39:57,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 15:39:57,577 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 403 [2018-10-15 15:39:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:57,579 INFO L225 Difference]: With dead ends: 415 [2018-10-15 15:39:57,579 INFO L226 Difference]: Without dead ends: 411 [2018-10-15 15:39:57,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2849 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=459, Invalid=23103, Unknown=0, NotChecked=0, Total=23562 [2018-10-15 15:39:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-15 15:39:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2018-10-15 15:39:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-15 15:39:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 412 transitions. [2018-10-15 15:39:57,583 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 412 transitions. Word has length 403 [2018-10-15 15:39:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:57,583 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 412 transitions. [2018-10-15 15:39:57,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 15:39:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 412 transitions. [2018-10-15 15:39:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-15 15:39:57,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:57,585 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:57,585 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:57,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:57,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1728953682, now seen corresponding path program 38 times [2018-10-15 15:39:57,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4398 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:40:01,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:01,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:40:01,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:40:01,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:40:01,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6319, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:40:01,164 INFO L87 Difference]: Start difference. First operand 409 states and 412 transitions. Second operand 81 states. [2018-10-15 15:40:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:12,200 INFO L93 Difference]: Finished difference Result 420 states and 423 transitions. [2018-10-15 15:40:12,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-10-15 15:40:12,201 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 408 [2018-10-15 15:40:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:12,202 INFO L225 Difference]: With dead ends: 420 [2018-10-15 15:40:12,202 INFO L226 Difference]: Without dead ends: 416 [2018-10-15 15:40:12,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3002 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=471, Invalid=24335, Unknown=0, NotChecked=0, Total=24806 [2018-10-15 15:40:12,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-10-15 15:40:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2018-10-15 15:40:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-15 15:40:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 417 transitions. [2018-10-15 15:40:12,207 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 417 transitions. Word has length 408 [2018-10-15 15:40:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:12,207 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 417 transitions. [2018-10-15 15:40:12,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:40:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 417 transitions. [2018-10-15 15:40:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-15 15:40:12,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:12,209 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:12,209 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:12,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1745511739, now seen corresponding path program 39 times [2018-10-15 15:40:12,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4590 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:40:15,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:15,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 15:40:15,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 15:40:15,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 15:40:15,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6641, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:40:15,699 INFO L87 Difference]: Start difference. First operand 414 states and 417 transitions. Second operand 83 states. [2018-10-15 15:40:27,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:27,260 INFO L93 Difference]: Finished difference Result 425 states and 428 transitions. [2018-10-15 15:40:27,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-15 15:40:27,261 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 413 [2018-10-15 15:40:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:27,262 INFO L225 Difference]: With dead ends: 425 [2018-10-15 15:40:27,262 INFO L226 Difference]: Without dead ends: 421 [2018-10-15 15:40:27,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3159 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=483, Invalid=25599, Unknown=0, NotChecked=0, Total=26082 [2018-10-15 15:40:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-15 15:40:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 419. [2018-10-15 15:40:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-15 15:40:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 422 transitions. [2018-10-15 15:40:27,266 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 422 transitions. Word has length 413 [2018-10-15 15:40:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:27,266 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 422 transitions. [2018-10-15 15:40:27,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 15:40:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 422 transitions. [2018-10-15 15:40:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-15 15:40:27,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:27,268 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:27,268 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:27,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:27,269 INFO L82 PathProgramCache]: Analyzing trace with hash -729237234, now seen corresponding path program 40 times [2018-10-15 15:40:27,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4787 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:40:30,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:30,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 15:40:30,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 15:40:30,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 15:40:30,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=6971, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:40:30,796 INFO L87 Difference]: Start difference. First operand 419 states and 422 transitions. Second operand 85 states. [2018-10-15 15:40:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:42,331 INFO L93 Difference]: Finished difference Result 430 states and 433 transitions. [2018-10-15 15:40:42,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-10-15 15:40:42,332 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 418 [2018-10-15 15:40:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:42,333 INFO L225 Difference]: With dead ends: 430 [2018-10-15 15:40:42,333 INFO L226 Difference]: Without dead ends: 426 [2018-10-15 15:40:42,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3320 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=495, Invalid=26895, Unknown=0, NotChecked=0, Total=27390 [2018-10-15 15:40:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-15 15:40:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 424. [2018-10-15 15:40:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-15 15:40:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 427 transitions. [2018-10-15 15:40:42,337 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 427 transitions. Word has length 418 [2018-10-15 15:40:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:42,337 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 427 transitions. [2018-10-15 15:40:42,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 15:40:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 427 transitions. [2018-10-15 15:40:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-10-15 15:40:42,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:42,339 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:42,339 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:42,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash 701112421, now seen corresponding path program 41 times [2018-10-15 15:40:42,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4989 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:40:46,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:46,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:40:46,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:40:46,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:40:46,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7309, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:40:46,271 INFO L87 Difference]: Start difference. First operand 424 states and 427 transitions. Second operand 87 states. [2018-10-15 15:40:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:58,209 INFO L93 Difference]: Finished difference Result 435 states and 438 transitions. [2018-10-15 15:40:58,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-15 15:40:58,210 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 423 [2018-10-15 15:40:58,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:58,211 INFO L225 Difference]: With dead ends: 435 [2018-10-15 15:40:58,211 INFO L226 Difference]: Without dead ends: 431 [2018-10-15 15:40:58,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=507, Invalid=28223, Unknown=0, NotChecked=0, Total=28730 [2018-10-15 15:40:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-15 15:40:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2018-10-15 15:40:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-10-15 15:40:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 432 transitions. [2018-10-15 15:40:58,215 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 432 transitions. Word has length 423 [2018-10-15 15:40:58,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:58,215 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 432 transitions. [2018-10-15 15:40:58,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:40:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 432 transitions. [2018-10-15 15:40:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-10-15 15:40:58,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:58,217 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:58,217 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:58,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:58,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1288091502, now seen corresponding path program 42 times [2018-10-15 15:40:58,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5196 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:41:02,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:02,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 15:41:02,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 15:41:02,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 15:41:02,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7655, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:41:02,045 INFO L87 Difference]: Start difference. First operand 429 states and 432 transitions. Second operand 89 states. [2018-10-15 15:41:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:14,697 INFO L93 Difference]: Finished difference Result 440 states and 443 transitions. [2018-10-15 15:41:14,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-15 15:41:14,697 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 428 [2018-10-15 15:41:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:14,698 INFO L225 Difference]: With dead ends: 440 [2018-10-15 15:41:14,699 INFO L226 Difference]: Without dead ends: 436 [2018-10-15 15:41:14,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3654 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=519, Invalid=29583, Unknown=0, NotChecked=0, Total=30102 [2018-10-15 15:41:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-15 15:41:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-10-15 15:41:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 15:41:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 437 transitions. [2018-10-15 15:41:14,702 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 437 transitions. Word has length 428 [2018-10-15 15:41:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:14,703 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 437 transitions. [2018-10-15 15:41:14,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 15:41:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 437 transitions. [2018-10-15 15:41:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-15 15:41:14,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:14,705 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:14,705 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:14,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1651252741, now seen corresponding path program 43 times [2018-10-15 15:41:14,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:41:18,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:18,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 15:41:18,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 15:41:18,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 15:41:18,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8009, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:41:18,665 INFO L87 Difference]: Start difference. First operand 434 states and 437 transitions. Second operand 91 states. [2018-10-15 15:41:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:31,497 INFO L93 Difference]: Finished difference Result 445 states and 448 transitions. [2018-10-15 15:41:31,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-15 15:41:31,498 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 433 [2018-10-15 15:41:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:31,499 INFO L225 Difference]: With dead ends: 445 [2018-10-15 15:41:31,499 INFO L226 Difference]: Without dead ends: 441 [2018-10-15 15:41:31,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3827 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=531, Invalid=30975, Unknown=0, NotChecked=0, Total=31506 [2018-10-15 15:41:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-10-15 15:41:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 439. [2018-10-15 15:41:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-15 15:41:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 442 transitions. [2018-10-15 15:41:31,504 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 442 transitions. Word has length 433 [2018-10-15 15:41:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:31,504 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 442 transitions. [2018-10-15 15:41:31,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 15:41:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 442 transitions. [2018-10-15 15:41:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-15 15:41:31,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:31,506 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:31,506 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:31,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:31,506 INFO L82 PathProgramCache]: Analyzing trace with hash 467811790, now seen corresponding path program 44 times [2018-10-15 15:41:31,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:41:35,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:35,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:41:35,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:41:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:41:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8371, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:41:35,636 INFO L87 Difference]: Start difference. First operand 439 states and 442 transitions. Second operand 93 states. [2018-10-15 15:41:42,230 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 15:41:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:49,509 INFO L93 Difference]: Finished difference Result 450 states and 453 transitions. [2018-10-15 15:41:49,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-15 15:41:49,510 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 438 [2018-10-15 15:41:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:49,511 INFO L225 Difference]: With dead ends: 450 [2018-10-15 15:41:49,511 INFO L226 Difference]: Without dead ends: 446 [2018-10-15 15:41:49,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4004 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=543, Invalid=32399, Unknown=0, NotChecked=0, Total=32942 [2018-10-15 15:41:49,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-10-15 15:41:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 444. [2018-10-15 15:41:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-10-15 15:41:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 447 transitions. [2018-10-15 15:41:49,515 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 447 transitions. Word has length 438 [2018-10-15 15:41:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:49,516 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 447 transitions. [2018-10-15 15:41:49,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:41:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 447 transitions. [2018-10-15 15:41:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-10-15 15:41:49,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:49,518 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:49,518 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:49,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:49,518 INFO L82 PathProgramCache]: Analyzing trace with hash 426087333, now seen corresponding path program 45 times [2018-10-15 15:41:49,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5847 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:41:53,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:53,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 15:41:53,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 15:41:53,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 15:41:53,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8741, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:41:53,829 INFO L87 Difference]: Start difference. First operand 444 states and 447 transitions. Second operand 95 states. [2018-10-15 15:42:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:07,881 INFO L93 Difference]: Finished difference Result 455 states and 458 transitions. [2018-10-15 15:42:07,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-15 15:42:07,881 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 443 [2018-10-15 15:42:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:07,883 INFO L225 Difference]: With dead ends: 455 [2018-10-15 15:42:07,883 INFO L226 Difference]: Without dead ends: 451 [2018-10-15 15:42:07,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4185 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=555, Invalid=33855, Unknown=0, NotChecked=0, Total=34410 [2018-10-15 15:42:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-10-15 15:42:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2018-10-15 15:42:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-10-15 15:42:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 452 transitions. [2018-10-15 15:42:07,887 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 452 transitions. Word has length 443 [2018-10-15 15:42:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:07,887 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 452 transitions. [2018-10-15 15:42:07,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 15:42:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 452 transitions. [2018-10-15 15:42:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-10-15 15:42:07,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:07,889 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:07,889 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:07,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:07,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1869525970, now seen corresponding path program 46 times [2018-10-15 15:42:07,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6074 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:42:12,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:12,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 15:42:12,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 15:42:12,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 15:42:12,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9119, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:42:12,684 INFO L87 Difference]: Start difference. First operand 449 states and 452 transitions. Second operand 97 states. [2018-10-15 15:42:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:27,301 INFO L93 Difference]: Finished difference Result 460 states and 463 transitions. [2018-10-15 15:42:27,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-10-15 15:42:27,301 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 448 [2018-10-15 15:42:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:27,302 INFO L225 Difference]: With dead ends: 460 [2018-10-15 15:42:27,302 INFO L226 Difference]: Without dead ends: 456 [2018-10-15 15:42:27,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4370 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=567, Invalid=35343, Unknown=0, NotChecked=0, Total=35910 [2018-10-15 15:42:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-10-15 15:42:27,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 454. [2018-10-15 15:42:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-10-15 15:42:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 457 transitions. [2018-10-15 15:42:27,306 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 457 transitions. Word has length 448 [2018-10-15 15:42:27,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:27,307 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 457 transitions. [2018-10-15 15:42:27,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 15:42:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 457 transitions. [2018-10-15 15:42:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-10-15 15:42:27,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:27,309 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:27,309 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:27,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:27,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1044348603, now seen corresponding path program 47 times [2018-10-15 15:42:27,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6306 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:42:31,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:31,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:42:31,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:42:31,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:42:31,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9505, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:42:31,972 INFO L87 Difference]: Start difference. First operand 454 states and 457 transitions. Second operand 99 states. [2018-10-15 15:42:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:47,234 INFO L93 Difference]: Finished difference Result 465 states and 468 transitions. [2018-10-15 15:42:47,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-15 15:42:47,234 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 453 [2018-10-15 15:42:47,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:47,236 INFO L225 Difference]: With dead ends: 465 [2018-10-15 15:42:47,236 INFO L226 Difference]: Without dead ends: 461 [2018-10-15 15:42:47,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4559 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=579, Invalid=36863, Unknown=0, NotChecked=0, Total=37442 [2018-10-15 15:42:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-10-15 15:42:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2018-10-15 15:42:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-10-15 15:42:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 462 transitions. [2018-10-15 15:42:47,240 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 462 transitions. Word has length 453 [2018-10-15 15:42:47,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:47,240 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 462 transitions. [2018-10-15 15:42:47,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:42:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 462 transitions. [2018-10-15 15:42:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-10-15 15:42:47,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:47,242 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:47,242 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:47,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:47,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1911954802, now seen corresponding path program 48 times [2018-10-15 15:42:47,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6543 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:42:52,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:52,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 15:42:52,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 15:42:52,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 15:42:52,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=9899, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:42:52,043 INFO L87 Difference]: Start difference. First operand 459 states and 462 transitions. Second operand 101 states. [2018-10-15 15:43:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:43:08,005 INFO L93 Difference]: Finished difference Result 470 states and 473 transitions. [2018-10-15 15:43:08,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-10-15 15:43:08,005 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 458 [2018-10-15 15:43:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:43:08,006 INFO L225 Difference]: With dead ends: 470 [2018-10-15 15:43:08,007 INFO L226 Difference]: Without dead ends: 466 [2018-10-15 15:43:08,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=591, Invalid=38415, Unknown=0, NotChecked=0, Total=39006 [2018-10-15 15:43:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-10-15 15:43:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2018-10-15 15:43:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-10-15 15:43:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 467 transitions. [2018-10-15 15:43:08,011 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 467 transitions. Word has length 458 [2018-10-15 15:43:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:43:08,012 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 467 transitions. [2018-10-15 15:43:08,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 15:43:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 467 transitions. [2018-10-15 15:43:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-15 15:43:08,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:43:08,014 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:43:08,014 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:43:08,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:43:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash 168224485, now seen corresponding path program 49 times [2018-10-15 15:43:08,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:43:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:43:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6785 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:43:13,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:43:13,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 15:43:13,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 15:43:13,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 15:43:13,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10301, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:43:13,028 INFO L87 Difference]: Start difference. First operand 464 states and 467 transitions. Second operand 103 states. [2018-10-15 15:43:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:43:29,536 INFO L93 Difference]: Finished difference Result 475 states and 478 transitions. [2018-10-15 15:43:29,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-10-15 15:43:29,536 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 463 [2018-10-15 15:43:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:43:29,537 INFO L225 Difference]: With dead ends: 475 [2018-10-15 15:43:29,538 INFO L226 Difference]: Without dead ends: 471 [2018-10-15 15:43:29,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4949 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=603, Invalid=39999, Unknown=0, NotChecked=0, Total=40602 [2018-10-15 15:43:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-10-15 15:43:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2018-10-15 15:43:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-10-15 15:43:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 472 transitions. [2018-10-15 15:43:29,542 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 472 transitions. Word has length 463 [2018-10-15 15:43:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:43:29,542 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 472 transitions. [2018-10-15 15:43:29,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 15:43:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 472 transitions. [2018-10-15 15:43:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-10-15 15:43:29,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:43:29,544 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:43:29,545 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:43:29,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:43:29,545 INFO L82 PathProgramCache]: Analyzing trace with hash -335413010, now seen corresponding path program 50 times [2018-10-15 15:43:29,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:43:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:43:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7032 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:43:34,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:43:34,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:43:34,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:43:34,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:43:34,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10711, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:43:34,762 INFO L87 Difference]: Start difference. First operand 469 states and 472 transitions. Second operand 105 states. [2018-10-15 15:43:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:43:51,848 INFO L93 Difference]: Finished difference Result 480 states and 483 transitions. [2018-10-15 15:43:51,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-10-15 15:43:51,848 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 468 [2018-10-15 15:43:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:43:51,850 INFO L225 Difference]: With dead ends: 480 [2018-10-15 15:43:51,850 INFO L226 Difference]: Without dead ends: 476 [2018-10-15 15:43:51,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5150 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=615, Invalid=41615, Unknown=0, NotChecked=0, Total=42230 [2018-10-15 15:43:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-10-15 15:43:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 474. [2018-10-15 15:43:51,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-10-15 15:43:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 477 transitions. [2018-10-15 15:43:51,854 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 477 transitions. Word has length 468 [2018-10-15 15:43:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:43:51,855 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 477 transitions. [2018-10-15 15:43:51,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:43:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 477 transitions. [2018-10-15 15:43:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-10-15 15:43:51,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:43:51,857 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:43:51,857 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:43:51,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:43:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2084750469, now seen corresponding path program 51 times [2018-10-15 15:43:51,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:43:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:43:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7284 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:43:57,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:43:57,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 15:43:57,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 15:43:57,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 15:43:57,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11129, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:43:57,051 INFO L87 Difference]: Start difference. First operand 474 states and 477 transitions. Second operand 107 states. [2018-10-15 15:44:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:44:14,760 INFO L93 Difference]: Finished difference Result 485 states and 488 transitions. [2018-10-15 15:44:14,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 15:44:14,761 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 473 [2018-10-15 15:44:14,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:44:14,762 INFO L225 Difference]: With dead ends: 485 [2018-10-15 15:44:14,762 INFO L226 Difference]: Without dead ends: 481 [2018-10-15 15:44:14,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5355 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=627, Invalid=43263, Unknown=0, NotChecked=0, Total=43890 [2018-10-15 15:44:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-10-15 15:44:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 479. [2018-10-15 15:44:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-15 15:44:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 482 transitions. [2018-10-15 15:44:14,767 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 482 transitions. Word has length 473 [2018-10-15 15:44:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:44:14,767 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 482 transitions. [2018-10-15 15:44:14,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 15:44:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 482 transitions. [2018-10-15 15:44:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-15 15:44:14,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:44:14,769 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:44:14,769 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:44:14,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:44:14,770 INFO L82 PathProgramCache]: Analyzing trace with hash -693131442, now seen corresponding path program 52 times [2018-10-15 15:44:14,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:44:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:44:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 7541 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-10-15 15:44:20,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:44:20,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 15:44:20,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 15:44:20,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 15:44:20,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11555, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 15:44:20,383 INFO L87 Difference]: Start difference. First operand 479 states and 482 transitions. Second operand 109 states.