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/gr2006.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:32:04,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:32:04,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:32:04,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:32:04,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:32:04,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:32:04,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:32:04,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:32:04,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:32:04,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:32:04,515 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:32:04,515 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:32:04,516 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:32:04,517 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:32:04,518 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:32:04,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:32:04,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:32:04,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:32:04,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:32:04,526 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:32:04,527 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:32:04,528 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:32:04,531 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:32:04,531 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:32:04,531 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:32:04,532 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:32:04,534 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:32:04,534 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:32:04,535 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:32:04,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:32:04,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:32:04,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:32:04,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:32:04,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:32:04,539 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:32:04,540 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:32:04,540 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:32:04,550 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:32:04,551 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:32:04,551 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:32:04,552 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:32:04,552 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:32:04,552 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:32:04,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:32:04,553 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:32:04,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:32:04,553 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:32:04,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:32:04,554 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:32:04,554 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:32:04,555 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:32:04,555 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:32:04,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:32:04,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:32:04,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:32:04,634 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:32:04,634 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:32:04,635 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gr2006.c.i_4.bpl [2018-10-15 15:32:04,636 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gr2006.c.i_4.bpl' [2018-10-15 15:32:04,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:32:04,698 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:32:04,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:32:04,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:32:04,699 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:32:04,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:04" (1/1) ... [2018-10-15 15:32:04,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:04" (1/1) ... [2018-10-15 15:32:04,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:04" (1/1) ... [2018-10-15 15:32:04,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:04" (1/1) ... [2018-10-15 15:32:04,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:04" (1/1) ... [2018-10-15 15:32:04,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:04" (1/1) ... [2018-10-15 15:32:04,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:04" (1/1) ... [2018-10-15 15:32:04,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:32:04,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:32:04,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:32:04,757 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:32:04,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:04" (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:32:04,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:32:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:32:05,185 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:32:05,186 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:32:05 BoogieIcfgContainer [2018-10-15 15:32:05,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:32:05,187 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:32:05,187 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:32:05,188 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:32:05,192 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:32:05" (1/1) ... [2018-10-15 15:32:05,197 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:32:05,214 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:32:05 BasicIcfg [2018-10-15 15:32:05,215 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:32:05,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:32:05,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:32:05,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:32:05,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:04" (1/3) ... [2018-10-15 15:32:05,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101dedbb and model type gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:32:05, skipping insertion in model container [2018-10-15 15:32:05,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:32:05" (2/3) ... [2018-10-15 15:32:05,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101dedbb and model type gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:32:05, skipping insertion in model container [2018-10-15 15:32:05,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:32:05" (3/3) ... [2018-10-15 15:32:05,224 INFO L112 eAbstractionObserver]: Analyzing ICFG gr2006.c.i_4.bplleft_unchanged_by_heapseparator [2018-10-15 15:32:05,234 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:32:05,243 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:32:05,261 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:32:05,291 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:32:05,292 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:32:05,292 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:32:05,292 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:32:05,292 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:32:05,293 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:32:05,293 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:32:05,293 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:32:05,293 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:32:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-10-15 15:32:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 15:32:05,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:05,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:05,320 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:05,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:05,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2077683693, now seen corresponding path program 1 times [2018-10-15 15:32:05,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:05,539 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:32:05,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:32:05,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:32:05,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:32:05,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:32:05,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:32:05,568 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2018-10-15 15:32:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:05,733 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-10-15 15:32:05,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:32:05,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-15 15:32:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:05,746 INFO L225 Difference]: With dead ends: 42 [2018-10-15 15:32:05,746 INFO L226 Difference]: Without dead ends: 42 [2018-10-15 15:32:05,749 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:32:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-15 15:32:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 29. [2018-10-15 15:32:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 15:32:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-10-15 15:32:05,790 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 19 [2018-10-15 15:32:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:05,790 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-10-15 15:32:05,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:32:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-10-15 15:32:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 15:32:05,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:05,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:05,792 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:05,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash -19574701, now seen corresponding path program 1 times [2018-10-15 15:32:05,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:05,892 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:32:05,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:32:05,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 15:32:05,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:32:05,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:32:05,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:32:05,899 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-10-15 15:32:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:06,017 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-10-15 15:32:06,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:32:06,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-15 15:32:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:06,019 INFO L225 Difference]: With dead ends: 40 [2018-10-15 15:32:06,019 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 15:32:06,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:32:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 15:32:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2018-10-15 15:32:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-15 15:32:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-10-15 15:32:06,026 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 19 [2018-10-15 15:32:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:06,027 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-10-15 15:32:06,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:32:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-10-15 15:32:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 15:32:06,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:06,028 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:06,029 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:06,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:06,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1317180598, now seen corresponding path program 1 times [2018-10-15 15:32:06,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:06,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:06,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:32:06,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:32:06,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:32:06,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:32:06,151 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states. [2018-10-15 15:32:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:06,437 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-10-15 15:32:06,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:32:06,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-10-15 15:32:06,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:06,439 INFO L225 Difference]: With dead ends: 46 [2018-10-15 15:32:06,440 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 15:32:06,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:32:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 15:32:06,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-10-15 15:32:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 15:32:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-10-15 15:32:06,446 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 29 [2018-10-15 15:32:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:06,447 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-10-15 15:32:06,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:32:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-10-15 15:32:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 15:32:06,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:06,449 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:06,449 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:06,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1904316991, now seen corresponding path program 2 times [2018-10-15 15:32:06,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:06,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:06,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:32:06,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:32:06,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:32:06,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:32:06,625 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 7 states. [2018-10-15 15:32:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:06,879 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-10-15 15:32:06,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:32:06,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-10-15 15:32:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:06,882 INFO L225 Difference]: With dead ends: 56 [2018-10-15 15:32:06,883 INFO L226 Difference]: Without dead ends: 56 [2018-10-15 15:32:06,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:32:06,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-15 15:32:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-10-15 15:32:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-15 15:32:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-10-15 15:32:06,899 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 39 [2018-10-15 15:32:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:06,902 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-10-15 15:32:06,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:32:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-10-15 15:32:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 15:32:06,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:06,905 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:06,905 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:06,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:06,907 INFO L82 PathProgramCache]: Analyzing trace with hash -571209864, now seen corresponding path program 3 times [2018-10-15 15:32:06,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:07,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:07,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:32:07,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:32:07,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:32:07,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:32:07,059 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 9 states. [2018-10-15 15:32:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:07,600 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-10-15 15:32:07,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 15:32:07,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-10-15 15:32:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:07,604 INFO L225 Difference]: With dead ends: 66 [2018-10-15 15:32:07,604 INFO L226 Difference]: Without dead ends: 66 [2018-10-15 15:32:07,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:32:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-15 15:32:07,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-10-15 15:32:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 15:32:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-15 15:32:07,612 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 49 [2018-10-15 15:32:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:07,613 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-15 15:32:07,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:32:07,613 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-15 15:32:07,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 15:32:07,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:07,615 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:07,616 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:07,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:07,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1031415919, now seen corresponding path program 4 times [2018-10-15 15:32:07,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:07,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:07,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:32:07,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:32:07,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:32:07,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:32:07,825 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 11 states. [2018-10-15 15:32:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:08,404 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-10-15 15:32:08,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:32:08,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-10-15 15:32:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:08,409 INFO L225 Difference]: With dead ends: 76 [2018-10-15 15:32:08,409 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 15:32:08,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:32:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 15:32:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-10-15 15:32:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-15 15:32:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-10-15 15:32:08,423 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 59 [2018-10-15 15:32:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:08,424 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-10-15 15:32:08,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:32:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-10-15 15:32:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-15 15:32:08,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:08,426 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:08,427 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:08,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:08,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1400848218, now seen corresponding path program 5 times [2018-10-15 15:32:08,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 5 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:08,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:08,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:32:08,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:32:08,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:32:08,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:32:08,650 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 13 states. [2018-10-15 15:32:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:08,990 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2018-10-15 15:32:08,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:32:08,991 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-10-15 15:32:08,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:08,993 INFO L225 Difference]: With dead ends: 86 [2018-10-15 15:32:08,994 INFO L226 Difference]: Without dead ends: 86 [2018-10-15 15:32:08,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:32:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-15 15:32:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2018-10-15 15:32:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 15:32:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-10-15 15:32:09,001 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 69 [2018-10-15 15:32:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:09,002 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-10-15 15:32:09,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:32:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-10-15 15:32:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 15:32:09,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:09,004 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:09,004 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:09,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1397473309, now seen corresponding path program 6 times [2018-10-15 15:32:09,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:09,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:09,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:32:09,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:32:09,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:32:09,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:32:09,293 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 15 states. [2018-10-15 15:32:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:09,691 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-10-15 15:32:09,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 15:32:09,692 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2018-10-15 15:32:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:09,693 INFO L225 Difference]: With dead ends: 96 [2018-10-15 15:32:09,694 INFO L226 Difference]: Without dead ends: 96 [2018-10-15 15:32:09,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:32:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-15 15:32:09,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2018-10-15 15:32:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-15 15:32:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-10-15 15:32:09,701 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 79 [2018-10-15 15:32:09,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:09,702 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-10-15 15:32:09,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:32:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-10-15 15:32:09,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 15:32:09,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:09,704 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:09,704 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:09,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:09,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1980557612, now seen corresponding path program 7 times [2018-10-15 15:32:09,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 7 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:09,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:09,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:32:09,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:32:09,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:32:09,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:32:09,953 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 17 states. [2018-10-15 15:32:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:10,268 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2018-10-15 15:32:10,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 15:32:10,270 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2018-10-15 15:32:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:10,271 INFO L225 Difference]: With dead ends: 106 [2018-10-15 15:32:10,271 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 15:32:10,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:32:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 15:32:10,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2018-10-15 15:32:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 15:32:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-10-15 15:32:10,279 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 89 [2018-10-15 15:32:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:10,280 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-10-15 15:32:10,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:32:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-10-15 15:32:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 15:32:10,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:10,282 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:10,282 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:10,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 526562507, now seen corresponding path program 8 times [2018-10-15 15:32:10,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 8 proven. 304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:10,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:10,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:32:10,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:32:10,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:32:10,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:32:10,535 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 19 states. [2018-10-15 15:32:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:11,127 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2018-10-15 15:32:11,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 15:32:11,127 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 99 [2018-10-15 15:32:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:11,129 INFO L225 Difference]: With dead ends: 116 [2018-10-15 15:32:11,129 INFO L226 Difference]: Without dead ends: 116 [2018-10-15 15:32:11,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:32:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-15 15:32:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2018-10-15 15:32:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 15:32:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-10-15 15:32:11,138 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 99 [2018-10-15 15:32:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:11,138 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-10-15 15:32:11,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:32:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-10-15 15:32:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 15:32:11,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:11,142 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:11,143 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:11,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash -530937342, now seen corresponding path program 9 times [2018-10-15 15:32:11,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 9 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:11,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:11,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:32:11,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:32:11,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:32:11,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:32:11,714 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 21 states. [2018-10-15 15:32:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:12,111 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-10-15 15:32:12,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 15:32:12,112 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2018-10-15 15:32:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:12,113 INFO L225 Difference]: With dead ends: 126 [2018-10-15 15:32:12,113 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 15:32:12,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:32:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 15:32:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2018-10-15 15:32:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-15 15:32:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-10-15 15:32:12,121 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 109 [2018-10-15 15:32:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:12,121 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-10-15 15:32:12,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:32:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-10-15 15:32:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 15:32:12,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:12,123 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:12,123 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:12,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:12,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1584301689, now seen corresponding path program 10 times [2018-10-15 15:32:12,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 10 proven. 480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:12,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:12,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 15:32:12,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 15:32:12,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 15:32:12,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:32:12,484 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 23 states. [2018-10-15 15:32:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:12,895 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2018-10-15 15:32:12,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 15:32:12,895 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 119 [2018-10-15 15:32:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:12,897 INFO L225 Difference]: With dead ends: 136 [2018-10-15 15:32:12,897 INFO L226 Difference]: Without dead ends: 136 [2018-10-15 15:32:12,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:32:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-15 15:32:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2018-10-15 15:32:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-15 15:32:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-10-15 15:32:12,903 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 119 [2018-10-15 15:32:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:12,904 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-10-15 15:32:12,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 15:32:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-10-15 15:32:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-15 15:32:12,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:12,906 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:12,906 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:12,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:12,906 INFO L82 PathProgramCache]: Analyzing trace with hash -150562256, now seen corresponding path program 11 times [2018-10-15 15:32:12,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 11 proven. 583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:13,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:13,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 15:32:13,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 15:32:13,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 15:32:13,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:32:13,237 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 25 states. [2018-10-15 15:32:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:13,876 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2018-10-15 15:32:13,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 15:32:13,877 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 129 [2018-10-15 15:32:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:13,879 INFO L225 Difference]: With dead ends: 146 [2018-10-15 15:32:13,879 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 15:32:13,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:32:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 15:32:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2018-10-15 15:32:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 15:32:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-10-15 15:32:13,888 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 129 [2018-10-15 15:32:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:13,889 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-10-15 15:32:13,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 15:32:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-10-15 15:32:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 15:32:13,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:13,891 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:13,891 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:13,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:13,891 INFO L82 PathProgramCache]: Analyzing trace with hash 442414375, now seen corresponding path program 12 times [2018-10-15 15:32:13,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 12 proven. 696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:14,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:14,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:32:14,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:32:14,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:32:14,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:32:14,252 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 27 states. [2018-10-15 15:32:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:15,038 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-10-15 15:32:15,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 15:32:15,038 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 139 [2018-10-15 15:32:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:15,040 INFO L225 Difference]: With dead ends: 156 [2018-10-15 15:32:15,040 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 15:32:15,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:32:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 15:32:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2018-10-15 15:32:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 15:32:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-10-15 15:32:15,046 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 139 [2018-10-15 15:32:15,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:15,047 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-10-15 15:32:15,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:32:15,047 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-10-15 15:32:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 15:32:15,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:15,048 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:15,049 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:15,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:15,049 INFO L82 PathProgramCache]: Analyzing trace with hash -762919074, now seen corresponding path program 13 times [2018-10-15 15:32:15,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 13 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:15,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:15,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 15:32:15,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 15:32:15,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 15:32:15,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:32:15,807 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 29 states. [2018-10-15 15:32:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:16,610 INFO L93 Difference]: Finished difference Result 166 states and 167 transitions. [2018-10-15 15:32:16,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 15:32:16,611 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 149 [2018-10-15 15:32:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:16,613 INFO L225 Difference]: With dead ends: 166 [2018-10-15 15:32:16,613 INFO L226 Difference]: Without dead ends: 166 [2018-10-15 15:32:16,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:32:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-15 15:32:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2018-10-15 15:32:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-15 15:32:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-10-15 15:32:16,619 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 149 [2018-10-15 15:32:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:16,619 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-10-15 15:32:16,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 15:32:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-10-15 15:32:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 15:32:16,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:16,620 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:16,621 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:16,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1973239595, now seen corresponding path program 14 times [2018-10-15 15:32:16,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 14 proven. 952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:16,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:16,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 15:32:16,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 15:32:16,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 15:32:16,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:32:16,997 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 31 states. [2018-10-15 15:32:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:17,704 INFO L93 Difference]: Finished difference Result 176 states and 177 transitions. [2018-10-15 15:32:17,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 15:32:17,704 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 159 [2018-10-15 15:32:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:17,706 INFO L225 Difference]: With dead ends: 176 [2018-10-15 15:32:17,706 INFO L226 Difference]: Without dead ends: 176 [2018-10-15 15:32:17,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:32:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-15 15:32:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 170. [2018-10-15 15:32:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-15 15:32:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2018-10-15 15:32:17,711 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 159 [2018-10-15 15:32:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:17,712 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2018-10-15 15:32:17,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 15:32:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2018-10-15 15:32:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 15:32:17,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:17,713 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:17,713 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:17,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash 346722700, now seen corresponding path program 15 times [2018-10-15 15:32:17,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 15 proven. 1095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:18,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:18,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:32:18,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:32:18,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:32:18,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:32:18,255 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 33 states. [2018-10-15 15:32:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:18,898 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2018-10-15 15:32:18,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 15:32:18,899 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 169 [2018-10-15 15:32:18,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:18,901 INFO L225 Difference]: With dead ends: 186 [2018-10-15 15:32:18,901 INFO L226 Difference]: Without dead ends: 186 [2018-10-15 15:32:18,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:32:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-15 15:32:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 180. [2018-10-15 15:32:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-15 15:32:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-10-15 15:32:18,906 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 169 [2018-10-15 15:32:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:18,907 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-10-15 15:32:18,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:32:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-10-15 15:32:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 15:32:18,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:18,908 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:18,908 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:18,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash -219534973, now seen corresponding path program 16 times [2018-10-15 15:32:18,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 16 proven. 1248 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:20,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:20,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 15:32:20,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 15:32:20,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 15:32:20,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:32:20,379 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 35 states. [2018-10-15 15:32:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:21,175 INFO L93 Difference]: Finished difference Result 196 states and 197 transitions. [2018-10-15 15:32:21,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 15:32:21,176 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 179 [2018-10-15 15:32:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:21,178 INFO L225 Difference]: With dead ends: 196 [2018-10-15 15:32:21,178 INFO L226 Difference]: Without dead ends: 196 [2018-10-15 15:32:21,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:32:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-15 15:32:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2018-10-15 15:32:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-15 15:32:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-10-15 15:32:21,184 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 179 [2018-10-15 15:32:21,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:21,185 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-10-15 15:32:21,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 15:32:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-10-15 15:32:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-15 15:32:21,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:21,186 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:21,186 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:21,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:21,187 INFO L82 PathProgramCache]: Analyzing trace with hash -595494726, now seen corresponding path program 17 times [2018-10-15 15:32:21,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 17 proven. 1411 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:21,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:21,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 15:32:21,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 15:32:21,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 15:32:21,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:32:21,723 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 37 states. [2018-10-15 15:32:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:22,692 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2018-10-15 15:32:22,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 15:32:22,692 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 189 [2018-10-15 15:32:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:22,694 INFO L225 Difference]: With dead ends: 206 [2018-10-15 15:32:22,694 INFO L226 Difference]: Without dead ends: 206 [2018-10-15 15:32:22,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:32:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-15 15:32:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 200. [2018-10-15 15:32:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 15:32:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-10-15 15:32:22,700 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 189 [2018-10-15 15:32:22,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:22,701 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-10-15 15:32:22,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 15:32:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-10-15 15:32:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 15:32:22,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:22,702 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:22,703 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:22,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:22,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2052821199, now seen corresponding path program 18 times [2018-10-15 15:32:22,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 18 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:23,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:23,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:32:23,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:32:23,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:32:23,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:32:23,736 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 39 states. [2018-10-15 15:32:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:24,775 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2018-10-15 15:32:24,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 15:32:24,775 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 199 [2018-10-15 15:32:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:24,778 INFO L225 Difference]: With dead ends: 216 [2018-10-15 15:32:24,778 INFO L226 Difference]: Without dead ends: 216 [2018-10-15 15:32:24,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:32:24,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-15 15:32:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2018-10-15 15:32:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-15 15:32:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-10-15 15:32:24,784 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 199 [2018-10-15 15:32:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:24,785 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-10-15 15:32:24,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:32:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-10-15 15:32:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-15 15:32:24,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:24,787 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:24,787 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:24,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1503986456, now seen corresponding path program 19 times [2018-10-15 15:32:24,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 19 proven. 1767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:25,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:25,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 15:32:25,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 15:32:25,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 15:32:25,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:32:25,631 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 41 states. [2018-10-15 15:32:26,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:26,615 INFO L93 Difference]: Finished difference Result 226 states and 227 transitions. [2018-10-15 15:32:26,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 15:32:26,616 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 209 [2018-10-15 15:32:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:26,617 INFO L225 Difference]: With dead ends: 226 [2018-10-15 15:32:26,617 INFO L226 Difference]: Without dead ends: 226 [2018-10-15 15:32:26,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:32:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-15 15:32:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 220. [2018-10-15 15:32:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-15 15:32:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-10-15 15:32:26,623 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 209 [2018-10-15 15:32:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:26,624 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-10-15 15:32:26,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 15:32:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-10-15 15:32:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 15:32:26,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:26,625 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:26,625 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:26,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:26,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1098977759, now seen corresponding path program 20 times [2018-10-15 15:32:26,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 20 proven. 1960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:27,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:27,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:32:27,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:32:27,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:32:27,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:32:27,590 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 43 states. [2018-10-15 15:32:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:28,685 INFO L93 Difference]: Finished difference Result 236 states and 237 transitions. [2018-10-15 15:32:28,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 15:32:28,688 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 219 [2018-10-15 15:32:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:28,690 INFO L225 Difference]: With dead ends: 236 [2018-10-15 15:32:28,690 INFO L226 Difference]: Without dead ends: 236 [2018-10-15 15:32:28,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:32:28,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-15 15:32:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 230. [2018-10-15 15:32:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 15:32:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-10-15 15:32:28,696 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 219 [2018-10-15 15:32:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:28,697 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-10-15 15:32:28,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:32:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-10-15 15:32:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 15:32:28,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:28,698 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:28,698 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:28,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:28,698 INFO L82 PathProgramCache]: Analyzing trace with hash 734436886, now seen corresponding path program 21 times [2018-10-15 15:32:28,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 21 proven. 2163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:29,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:29,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:32:29,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:32:29,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:32:29,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:32:29,816 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 45 states. [2018-10-15 15:32:31,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:31,281 INFO L93 Difference]: Finished difference Result 246 states and 247 transitions. [2018-10-15 15:32:31,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 15:32:31,282 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 229 [2018-10-15 15:32:31,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:31,285 INFO L225 Difference]: With dead ends: 246 [2018-10-15 15:32:31,285 INFO L226 Difference]: Without dead ends: 246 [2018-10-15 15:32:31,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:32:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-15 15:32:31,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2018-10-15 15:32:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-15 15:32:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2018-10-15 15:32:31,291 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 229 [2018-10-15 15:32:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:31,291 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2018-10-15 15:32:31,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:32:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2018-10-15 15:32:31,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 15:32:31,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:31,293 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:31,293 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:31,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:31,294 INFO L82 PathProgramCache]: Analyzing trace with hash -760245875, now seen corresponding path program 22 times [2018-10-15 15:32:31,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 22 proven. 2376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:33,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:33,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:32:33,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:32:33,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:32:33,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:32:33,371 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 47 states. [2018-10-15 15:32:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:34,593 INFO L93 Difference]: Finished difference Result 256 states and 257 transitions. [2018-10-15 15:32:34,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 15:32:34,594 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 239 [2018-10-15 15:32:34,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:34,596 INFO L225 Difference]: With dead ends: 256 [2018-10-15 15:32:34,596 INFO L226 Difference]: Without dead ends: 256 [2018-10-15 15:32:34,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:32:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-15 15:32:34,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2018-10-15 15:32:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-15 15:32:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2018-10-15 15:32:34,601 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 239 [2018-10-15 15:32:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:34,602 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2018-10-15 15:32:34,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:32:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2018-10-15 15:32:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-15 15:32:34,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:34,603 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:34,604 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:34,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:34,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1133763652, now seen corresponding path program 23 times [2018-10-15 15:32:34,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 23 proven. 2599 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:35,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:35,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 15:32:35,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 15:32:35,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 15:32:35,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:32:35,898 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 49 states. [2018-10-15 15:32:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:37,326 INFO L93 Difference]: Finished difference Result 266 states and 267 transitions. [2018-10-15 15:32:37,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 15:32:37,327 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 249 [2018-10-15 15:32:37,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:37,329 INFO L225 Difference]: With dead ends: 266 [2018-10-15 15:32:37,330 INFO L226 Difference]: Without dead ends: 266 [2018-10-15 15:32:37,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:32:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-15 15:32:37,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2018-10-15 15:32:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 15:32:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 261 transitions. [2018-10-15 15:32:37,336 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 261 transitions. Word has length 249 [2018-10-15 15:32:37,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:37,336 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 261 transitions. [2018-10-15 15:32:37,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 15:32:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 261 transitions. [2018-10-15 15:32:37,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 15:32:37,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:37,338 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:37,338 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:37,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1923051067, now seen corresponding path program 24 times [2018-10-15 15:32:37,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:38,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 24 proven. 2832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:38,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:38,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:32:38,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:32:38,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:32:38,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:32:38,631 INFO L87 Difference]: Start difference. First operand 260 states and 261 transitions. Second operand 51 states. [2018-10-15 15:32:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:40,039 INFO L93 Difference]: Finished difference Result 276 states and 277 transitions. [2018-10-15 15:32:40,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 15:32:40,040 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 259 [2018-10-15 15:32:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:40,042 INFO L225 Difference]: With dead ends: 276 [2018-10-15 15:32:40,042 INFO L226 Difference]: Without dead ends: 276 [2018-10-15 15:32:40,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:32:40,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-15 15:32:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2018-10-15 15:32:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-15 15:32:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 271 transitions. [2018-10-15 15:32:40,048 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 271 transitions. Word has length 259 [2018-10-15 15:32:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:40,049 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 271 transitions. [2018-10-15 15:32:40,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:32:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 271 transitions. [2018-10-15 15:32:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 15:32:40,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:40,050 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:40,051 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:40,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:40,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1043187854, now seen corresponding path program 25 times [2018-10-15 15:32:40,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3100 backedges. 25 proven. 3075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:41,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:41,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 15:32:41,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 15:32:41,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 15:32:41,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:32:41,173 INFO L87 Difference]: Start difference. First operand 270 states and 271 transitions. Second operand 53 states. [2018-10-15 15:32:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:42,746 INFO L93 Difference]: Finished difference Result 286 states and 287 transitions. [2018-10-15 15:32:42,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 15:32:42,746 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 269 [2018-10-15 15:32:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:42,749 INFO L225 Difference]: With dead ends: 286 [2018-10-15 15:32:42,749 INFO L226 Difference]: Without dead ends: 286 [2018-10-15 15:32:42,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:32:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-15 15:32:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2018-10-15 15:32:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-15 15:32:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-10-15 15:32:42,754 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 269 [2018-10-15 15:32:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:42,755 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-10-15 15:32:42,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 15:32:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-10-15 15:32:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-15 15:32:42,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:42,757 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:42,757 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:42,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash -939513879, now seen corresponding path program 26 times [2018-10-15 15:32:42,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3354 backedges. 26 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:44,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:44,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 15:32:44,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 15:32:44,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 15:32:44,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:32:44,319 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 55 states. [2018-10-15 15:32:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:46,393 INFO L93 Difference]: Finished difference Result 296 states and 297 transitions. [2018-10-15 15:32:46,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 15:32:46,395 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 279 [2018-10-15 15:32:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:46,399 INFO L225 Difference]: With dead ends: 296 [2018-10-15 15:32:46,399 INFO L226 Difference]: Without dead ends: 296 [2018-10-15 15:32:46,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:32:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-15 15:32:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 290. [2018-10-15 15:32:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 15:32:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 291 transitions. [2018-10-15 15:32:46,405 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 291 transitions. Word has length 279 [2018-10-15 15:32:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:46,405 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 291 transitions. [2018-10-15 15:32:46,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 15:32:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 291 transitions. [2018-10-15 15:32:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 15:32:46,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:46,407 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:46,407 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:46,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1473327008, now seen corresponding path program 27 times [2018-10-15 15:32:46,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3618 backedges. 27 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:47,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:47,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:32:47,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:32:47,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:32:47,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:32:47,511 INFO L87 Difference]: Start difference. First operand 290 states and 291 transitions. Second operand 57 states. [2018-10-15 15:32:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:49,292 INFO L93 Difference]: Finished difference Result 306 states and 307 transitions. [2018-10-15 15:32:49,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 15:32:49,293 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 289 [2018-10-15 15:32:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:49,295 INFO L225 Difference]: With dead ends: 306 [2018-10-15 15:32:49,295 INFO L226 Difference]: Without dead ends: 306 [2018-10-15 15:32:49,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:32:49,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-15 15:32:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 300. [2018-10-15 15:32:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-15 15:32:49,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 301 transitions. [2018-10-15 15:32:49,301 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 301 transitions. Word has length 289 [2018-10-15 15:32:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:49,301 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 301 transitions. [2018-10-15 15:32:49,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:32:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 301 transitions. [2018-10-15 15:32:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 15:32:49,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:49,303 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:49,303 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:49,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash -960414057, now seen corresponding path program 28 times [2018-10-15 15:32:49,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 28 proven. 3864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:50,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:50,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 15:32:50,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 15:32:50,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 15:32:50,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:32:50,615 INFO L87 Difference]: Start difference. First operand 300 states and 301 transitions. Second operand 59 states. [2018-10-15 15:32:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:52,492 INFO L93 Difference]: Finished difference Result 316 states and 317 transitions. [2018-10-15 15:32:52,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 15:32:52,493 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 299 [2018-10-15 15:32:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:52,495 INFO L225 Difference]: With dead ends: 316 [2018-10-15 15:32:52,495 INFO L226 Difference]: Without dead ends: 316 [2018-10-15 15:32:52,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:32:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-15 15:32:52,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 310. [2018-10-15 15:32:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-15 15:32:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 311 transitions. [2018-10-15 15:32:52,500 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 311 transitions. Word has length 299 [2018-10-15 15:32:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:52,500 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 311 transitions. [2018-10-15 15:32:52,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 15:32:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 311 transitions. [2018-10-15 15:32:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-15 15:32:52,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:52,501 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:52,502 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:52,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1948271822, now seen corresponding path program 29 times [2018-10-15 15:32:52,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4176 backedges. 29 proven. 4147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:53,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:53,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 15:32:53,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 15:32:53,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 15:32:53,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:32:53,681 INFO L87 Difference]: Start difference. First operand 310 states and 311 transitions. Second operand 61 states. [2018-10-15 15:32:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:56,085 INFO L93 Difference]: Finished difference Result 326 states and 327 transitions. [2018-10-15 15:32:56,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 15:32:56,091 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 309 [2018-10-15 15:32:56,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:56,093 INFO L225 Difference]: With dead ends: 326 [2018-10-15 15:32:56,093 INFO L226 Difference]: Without dead ends: 326 [2018-10-15 15:32:56,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:32:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-15 15:32:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 320. [2018-10-15 15:32:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 15:32:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2018-10-15 15:32:56,098 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 309 [2018-10-15 15:32:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:56,098 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2018-10-15 15:32:56,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 15:32:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2018-10-15 15:32:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 15:32:56,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:56,100 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:56,100 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:56,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:56,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1877855675, now seen corresponding path program 30 times [2018-10-15 15:32:56,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 30 proven. 4440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:57,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:57,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:32:57,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:32:57,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:32:57,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:32:57,946 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 63 states. [2018-10-15 15:33:01,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:01,654 INFO L93 Difference]: Finished difference Result 336 states and 337 transitions. [2018-10-15 15:33:01,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 15:33:01,654 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 319 [2018-10-15 15:33:01,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:01,656 INFO L225 Difference]: With dead ends: 336 [2018-10-15 15:33:01,656 INFO L226 Difference]: Without dead ends: 336 [2018-10-15 15:33:01,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:33:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-15 15:33:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 330. [2018-10-15 15:33:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-15 15:33:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 331 transitions. [2018-10-15 15:33:01,662 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 331 transitions. Word has length 319 [2018-10-15 15:33:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:01,662 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 331 transitions. [2018-10-15 15:33:01,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:33:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 331 transitions. [2018-10-15 15:33:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-15 15:33:01,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:01,664 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:01,665 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:01,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash 579794684, now seen corresponding path program 31 times [2018-10-15 15:33:01,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 31 proven. 4743 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:03,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:03,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 15:33:03,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 15:33:03,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 15:33:03,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:33:03,064 INFO L87 Difference]: Start difference. First operand 330 states and 331 transitions. Second operand 65 states. [2018-10-15 15:33:05,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:05,242 INFO L93 Difference]: Finished difference Result 346 states and 347 transitions. [2018-10-15 15:33:05,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 15:33:05,243 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 329 [2018-10-15 15:33:05,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:05,244 INFO L225 Difference]: With dead ends: 346 [2018-10-15 15:33:05,244 INFO L226 Difference]: Without dead ends: 346 [2018-10-15 15:33:05,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:33:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-15 15:33:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 340. [2018-10-15 15:33:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-15 15:33:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 341 transitions. [2018-10-15 15:33:05,250 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 341 transitions. Word has length 329 [2018-10-15 15:33:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:05,250 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 341 transitions. [2018-10-15 15:33:05,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 15:33:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 341 transitions. [2018-10-15 15:33:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-15 15:33:05,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:05,252 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:05,253 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:05,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:05,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1382187763, now seen corresponding path program 32 times [2018-10-15 15:33:05,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5088 backedges. 32 proven. 5056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:07,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:07,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:33:07,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:33:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:33:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:33:07,044 INFO L87 Difference]: Start difference. First operand 340 states and 341 transitions. Second operand 67 states. [2018-10-15 15:33:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:09,385 INFO L93 Difference]: Finished difference Result 356 states and 357 transitions. [2018-10-15 15:33:09,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 15:33:09,386 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 339 [2018-10-15 15:33:09,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:09,388 INFO L225 Difference]: With dead ends: 356 [2018-10-15 15:33:09,388 INFO L226 Difference]: Without dead ends: 356 [2018-10-15 15:33:09,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:33:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-15 15:33:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 350. [2018-10-15 15:33:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 15:33:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 351 transitions. [2018-10-15 15:33:09,393 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 351 transitions. Word has length 339 [2018-10-15 15:33:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:09,393 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 351 transitions. [2018-10-15 15:33:09,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:33:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 351 transitions. [2018-10-15 15:33:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 15:33:09,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:09,396 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:09,396 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:09,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:09,396 INFO L82 PathProgramCache]: Analyzing trace with hash -332610006, now seen corresponding path program 33 times [2018-10-15 15:33:09,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5412 backedges. 33 proven. 5379 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:10,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:10,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:33:10,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:33:10,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:33:10,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:33:10,994 INFO L87 Difference]: Start difference. First operand 350 states and 351 transitions. Second operand 69 states. [2018-10-15 15:33:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:13,648 INFO L93 Difference]: Finished difference Result 366 states and 367 transitions. [2018-10-15 15:33:13,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 15:33:13,648 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 349 [2018-10-15 15:33:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:13,651 INFO L225 Difference]: With dead ends: 366 [2018-10-15 15:33:13,651 INFO L226 Difference]: Without dead ends: 366 [2018-10-15 15:33:13,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:33:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-10-15 15:33:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 360. [2018-10-15 15:33:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-15 15:33:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2018-10-15 15:33:13,657 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 349 [2018-10-15 15:33:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:13,658 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2018-10-15 15:33:13,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:33:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2018-10-15 15:33:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-15 15:33:13,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:13,660 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:13,660 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:13,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:13,661 INFO L82 PathProgramCache]: Analyzing trace with hash 694268065, now seen corresponding path program 34 times [2018-10-15 15:33:13,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5746 backedges. 34 proven. 5712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:15,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:15,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 15:33:15,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 15:33:15,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 15:33:15,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:33:15,914 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 71 states. [2018-10-15 15:33:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:18,760 INFO L93 Difference]: Finished difference Result 376 states and 377 transitions. [2018-10-15 15:33:18,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 15:33:18,761 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 359 [2018-10-15 15:33:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:18,763 INFO L225 Difference]: With dead ends: 376 [2018-10-15 15:33:18,763 INFO L226 Difference]: Without dead ends: 376 [2018-10-15 15:33:18,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:33:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-15 15:33:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 370. [2018-10-15 15:33:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-15 15:33:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 371 transitions. [2018-10-15 15:33:18,768 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 371 transitions. Word has length 359 [2018-10-15 15:33:18,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:18,768 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 371 transitions. [2018-10-15 15:33:18,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 15:33:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 371 transitions. [2018-10-15 15:33:18,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-15 15:33:18,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:18,771 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:18,771 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:18,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:18,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1219939752, now seen corresponding path program 35 times [2018-10-15 15:33:18,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 35 proven. 6055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:20,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:20,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 15:33:20,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 15:33:20,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 15:33:20,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:33:20,644 INFO L87 Difference]: Start difference. First operand 370 states and 371 transitions. Second operand 73 states. [2018-10-15 15:33:23,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:23,567 INFO L93 Difference]: Finished difference Result 386 states and 387 transitions. [2018-10-15 15:33:23,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 15:33:23,568 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 369 [2018-10-15 15:33:23,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:23,570 INFO L225 Difference]: With dead ends: 386 [2018-10-15 15:33:23,570 INFO L226 Difference]: Without dead ends: 386 [2018-10-15 15:33:23,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:33:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-15 15:33:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 380. [2018-10-15 15:33:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 15:33:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 381 transitions. [2018-10-15 15:33:23,575 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 381 transitions. Word has length 369 [2018-10-15 15:33:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:23,575 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 381 transitions. [2018-10-15 15:33:23,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 15:33:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 381 transitions. [2018-10-15 15:33:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 15:33:23,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:23,578 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:23,578 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:23,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:23,579 INFO L82 PathProgramCache]: Analyzing trace with hash -33604785, now seen corresponding path program 36 times [2018-10-15 15:33:23,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6444 backedges. 36 proven. 6408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:25,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:25,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:33:25,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:33:25,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:33:25,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:33:25,380 INFO L87 Difference]: Start difference. First operand 380 states and 381 transitions. Second operand 75 states. [2018-10-15 15:33:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:28,643 INFO L93 Difference]: Finished difference Result 396 states and 397 transitions. [2018-10-15 15:33:28,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 15:33:28,643 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 379 [2018-10-15 15:33:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:28,645 INFO L225 Difference]: With dead ends: 396 [2018-10-15 15:33:28,645 INFO L226 Difference]: Without dead ends: 396 [2018-10-15 15:33:28,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:33:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-15 15:33:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 390. [2018-10-15 15:33:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-15 15:33:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 391 transitions. [2018-10-15 15:33:28,650 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 391 transitions. Word has length 379 [2018-10-15 15:33:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:28,651 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 391 transitions. [2018-10-15 15:33:28,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:33:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 391 transitions. [2018-10-15 15:33:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-15 15:33:28,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:28,653 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:28,653 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:28,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:28,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1485587578, now seen corresponding path program 37 times [2018-10-15 15:33:28,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6808 backedges. 37 proven. 6771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:30,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:30,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 15:33:30,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 15:33:30,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 15:33:30,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:33:30,487 INFO L87 Difference]: Start difference. First operand 390 states and 391 transitions. Second operand 77 states. [2018-10-15 15:33:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:33,851 INFO L93 Difference]: Finished difference Result 406 states and 407 transitions. [2018-10-15 15:33:33,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 15:33:33,852 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 389 [2018-10-15 15:33:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:33,854 INFO L225 Difference]: With dead ends: 406 [2018-10-15 15:33:33,854 INFO L226 Difference]: Without dead ends: 406 [2018-10-15 15:33:33,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 15:33:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-15 15:33:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 400. [2018-10-15 15:33:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-15 15:33:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 401 transitions. [2018-10-15 15:33:33,859 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 401 transitions. Word has length 389 [2018-10-15 15:33:33,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:33,859 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 401 transitions. [2018-10-15 15:33:33,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 15:33:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 401 transitions. [2018-10-15 15:33:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-15 15:33:33,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:33,861 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:33,861 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:33,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:33,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1718264573, now seen corresponding path program 38 times [2018-10-15 15:33:33,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7182 backedges. 38 proven. 7144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:35,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:35,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 15:33:35,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 15:33:35,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 15:33:35,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:33:35,869 INFO L87 Difference]: Start difference. First operand 400 states and 401 transitions. Second operand 79 states. [2018-10-15 15:33:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:39,388 INFO L93 Difference]: Finished difference Result 416 states and 417 transitions. [2018-10-15 15:33:39,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 15:33:39,389 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 399 [2018-10-15 15:33:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:39,391 INFO L225 Difference]: With dead ends: 416 [2018-10-15 15:33:39,391 INFO L226 Difference]: Without dead ends: 416 [2018-10-15 15:33:39,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 15:33:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-10-15 15:33:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 410. [2018-10-15 15:33:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 15:33:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 411 transitions. [2018-10-15 15:33:39,396 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 411 transitions. Word has length 399 [2018-10-15 15:33:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:39,396 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 411 transitions. [2018-10-15 15:33:39,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 15:33:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 411 transitions. [2018-10-15 15:33:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-15 15:33:39,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:39,399 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:39,399 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:39,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash -42212940, now seen corresponding path program 39 times [2018-10-15 15:33:39,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7566 backedges. 39 proven. 7527 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:41,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:41,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:33:41,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:33:41,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:33:41,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:33:41,728 INFO L87 Difference]: Start difference. First operand 410 states and 411 transitions. Second operand 81 states. [2018-10-15 15:33:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:45,140 INFO L93 Difference]: Finished difference Result 426 states and 427 transitions. [2018-10-15 15:33:45,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 15:33:45,141 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 409 [2018-10-15 15:33:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:45,143 INFO L225 Difference]: With dead ends: 426 [2018-10-15 15:33:45,143 INFO L226 Difference]: Without dead ends: 426 [2018-10-15 15:33:45,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 15:33:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-15 15:33:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 420. [2018-10-15 15:33:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-15 15:33:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 421 transitions. [2018-10-15 15:33:45,149 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 421 transitions. Word has length 409 [2018-10-15 15:33:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:45,150 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 421 transitions. [2018-10-15 15:33:45,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:33:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 421 transitions. [2018-10-15 15:33:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-15 15:33:45,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:45,152 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:45,153 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:45,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:45,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2045548629, now seen corresponding path program 40 times [2018-10-15 15:33:45,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7960 backedges. 40 proven. 7920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:47,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:47,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 15:33:47,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 15:33:47,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 15:33:47,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:33:47,547 INFO L87 Difference]: Start difference. First operand 420 states and 421 transitions. Second operand 83 states. [2018-10-15 15:33:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:50,979 INFO L93 Difference]: Finished difference Result 436 states and 437 transitions. [2018-10-15 15:33:50,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 15:33:50,979 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 419 [2018-10-15 15:33:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:50,981 INFO L225 Difference]: With dead ends: 436 [2018-10-15 15:33:50,981 INFO L226 Difference]: Without dead ends: 436 [2018-10-15 15:33:50,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 15:33:50,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-15 15:33:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 430. [2018-10-15 15:33:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-15 15:33:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 431 transitions. [2018-10-15 15:33:50,987 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 431 transitions. Word has length 419 [2018-10-15 15:33:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:50,987 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 431 transitions. [2018-10-15 15:33:50,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 15:33:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 431 transitions. [2018-10-15 15:33:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-15 15:33:50,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:50,990 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:50,990 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:50,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash -143579934, now seen corresponding path program 41 times [2018-10-15 15:33:50,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8364 backedges. 41 proven. 8323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:53,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:53,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 15:33:53,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 15:33:53,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 15:33:53,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:33:53,418 INFO L87 Difference]: Start difference. First operand 430 states and 431 transitions. Second operand 85 states. [2018-10-15 15:33:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:56,997 INFO L93 Difference]: Finished difference Result 446 states and 447 transitions. [2018-10-15 15:33:56,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 15:33:56,997 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 429 [2018-10-15 15:33:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:56,998 INFO L225 Difference]: With dead ends: 446 [2018-10-15 15:33:56,999 INFO L226 Difference]: Without dead ends: 446 [2018-10-15 15:33:57,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 15:33:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-10-15 15:33:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2018-10-15 15:33:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-10-15 15:33:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 441 transitions. [2018-10-15 15:33:57,006 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 441 transitions. Word has length 429 [2018-10-15 15:33:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:57,006 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 441 transitions. [2018-10-15 15:33:57,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 15:33:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 441 transitions. [2018-10-15 15:33:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-10-15 15:33:57,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:57,009 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:57,009 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:57,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:57,010 INFO L82 PathProgramCache]: Analyzing trace with hash -307689127, now seen corresponding path program 42 times [2018-10-15 15:33:57,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 42 proven. 8736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:59,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:59,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:33:59,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:33:59,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:33:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:33:59,312 INFO L87 Difference]: Start difference. First operand 440 states and 441 transitions. Second operand 87 states. [2018-10-15 15:34:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:03,609 INFO L93 Difference]: Finished difference Result 456 states and 457 transitions. [2018-10-15 15:34:03,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 15:34:03,609 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 439 [2018-10-15 15:34:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:03,612 INFO L225 Difference]: With dead ends: 456 [2018-10-15 15:34:03,612 INFO L226 Difference]: Without dead ends: 456 [2018-10-15 15:34:03,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 15:34:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-10-15 15:34:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 450. [2018-10-15 15:34:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-15 15:34:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 451 transitions. [2018-10-15 15:34:03,617 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 451 transitions. Word has length 439 [2018-10-15 15:34:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:03,617 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 451 transitions. [2018-10-15 15:34:03,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:34:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 451 transitions. [2018-10-15 15:34:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-10-15 15:34:03,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:03,619 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:03,620 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:03,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:03,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1331493616, now seen corresponding path program 43 times [2018-10-15 15:34:03,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9202 backedges. 43 proven. 9159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:05,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:05,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 15:34:05,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 15:34:05,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 15:34:05,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:34:05,898 INFO L87 Difference]: Start difference. First operand 450 states and 451 transitions. Second operand 89 states. [2018-10-15 15:34:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:10,009 INFO L93 Difference]: Finished difference Result 466 states and 467 transitions. [2018-10-15 15:34:10,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 15:34:10,009 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 449 [2018-10-15 15:34:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:10,012 INFO L225 Difference]: With dead ends: 466 [2018-10-15 15:34:10,012 INFO L226 Difference]: Without dead ends: 466 [2018-10-15 15:34:10,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 15:34:10,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-10-15 15:34:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 460. [2018-10-15 15:34:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-15 15:34:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 461 transitions. [2018-10-15 15:34:10,018 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 461 transitions. Word has length 449 [2018-10-15 15:34:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:10,018 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 461 transitions. [2018-10-15 15:34:10,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 15:34:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 461 transitions. [2018-10-15 15:34:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-15 15:34:10,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:10,021 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:10,021 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:10,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:10,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2065369095, now seen corresponding path program 44 times [2018-10-15 15:34:10,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9636 backedges. 44 proven. 9592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:12,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:12,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 15:34:12,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 15:34:12,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 15:34:12,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:34:12,673 INFO L87 Difference]: Start difference. First operand 460 states and 461 transitions. Second operand 91 states. [2018-10-15 15:34:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:16,782 INFO L93 Difference]: Finished difference Result 476 states and 477 transitions. [2018-10-15 15:34:16,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 15:34:16,782 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 459 [2018-10-15 15:34:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:16,784 INFO L225 Difference]: With dead ends: 476 [2018-10-15 15:34:16,784 INFO L226 Difference]: Without dead ends: 476 [2018-10-15 15:34:16,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 15:34:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-10-15 15:34:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 470. [2018-10-15 15:34:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-15 15:34:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 471 transitions. [2018-10-15 15:34:16,789 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 471 transitions. Word has length 459 [2018-10-15 15:34:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:16,790 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 471 transitions. [2018-10-15 15:34:16,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 15:34:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 471 transitions. [2018-10-15 15:34:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-15 15:34:16,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:16,792 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:16,792 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:16,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:16,792 INFO L82 PathProgramCache]: Analyzing trace with hash 27329086, now seen corresponding path program 45 times [2018-10-15 15:34:16,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10080 backedges. 45 proven. 10035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:19,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:19,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:34:19,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:34:19,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:34:19,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:34:19,706 INFO L87 Difference]: Start difference. First operand 470 states and 471 transitions. Second operand 93 states. [2018-10-15 15:34:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:24,218 INFO L93 Difference]: Finished difference Result 486 states and 487 transitions. [2018-10-15 15:34:24,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 15:34:24,219 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 469 [2018-10-15 15:34:24,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:24,220 INFO L225 Difference]: With dead ends: 486 [2018-10-15 15:34:24,221 INFO L226 Difference]: Without dead ends: 486 [2018-10-15 15:34:24,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 15:34:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-15 15:34:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 480. [2018-10-15 15:34:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-15 15:34:24,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 481 transitions. [2018-10-15 15:34:24,226 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 481 transitions. Word has length 469 [2018-10-15 15:34:24,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:24,227 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 481 transitions. [2018-10-15 15:34:24,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:34:24,227 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 481 transitions. [2018-10-15 15:34:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-15 15:34:24,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:24,229 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:24,229 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:24,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash 966321077, now seen corresponding path program 46 times [2018-10-15 15:34:24,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 46 proven. 10488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:26,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:26,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 15:34:26,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 15:34:26,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 15:34:26,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:34:26,786 INFO L87 Difference]: Start difference. First operand 480 states and 481 transitions. Second operand 95 states. [2018-10-15 15:34:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:31,480 INFO L93 Difference]: Finished difference Result 496 states and 497 transitions. [2018-10-15 15:34:31,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 15:34:31,481 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 479 [2018-10-15 15:34:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:31,482 INFO L225 Difference]: With dead ends: 496 [2018-10-15 15:34:31,482 INFO L226 Difference]: Without dead ends: 496 [2018-10-15 15:34:31,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 15:34:31,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-10-15 15:34:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 490. [2018-10-15 15:34:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-10-15 15:34:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 491 transitions. [2018-10-15 15:34:31,489 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 491 transitions. Word has length 479 [2018-10-15 15:34:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:31,489 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 491 transitions. [2018-10-15 15:34:31,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 15:34:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 491 transitions. [2018-10-15 15:34:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-10-15 15:34:31,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:31,492 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:31,492 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:31,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:31,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1614453868, now seen corresponding path program 47 times [2018-10-15 15:34:31,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10998 backedges. 47 proven. 10951 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:34,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:34,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 15:34:34,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 15:34:34,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 15:34:34,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:34:34,566 INFO L87 Difference]: Start difference. First operand 490 states and 491 transitions. Second operand 97 states. [2018-10-15 15:34:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:39,917 INFO L93 Difference]: Finished difference Result 506 states and 507 transitions. [2018-10-15 15:34:39,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 15:34:39,917 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 489 [2018-10-15 15:34:39,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:39,919 INFO L225 Difference]: With dead ends: 506 [2018-10-15 15:34:39,919 INFO L226 Difference]: Without dead ends: 506 [2018-10-15 15:34:39,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 15:34:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-10-15 15:34:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 500. [2018-10-15 15:34:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-10-15 15:34:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 501 transitions. [2018-10-15 15:34:39,925 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 501 transitions. Word has length 489 [2018-10-15 15:34:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:39,925 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 501 transitions. [2018-10-15 15:34:39,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 15:34:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 501 transitions. [2018-10-15 15:34:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 15:34:39,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:39,928 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:39,928 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:39,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:39,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1100094563, now seen corresponding path program 48 times [2018-10-15 15:34:39,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11472 backedges. 48 proven. 11424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:42,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:42,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:34:42,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:34:42,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:34:42,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:34:42,690 INFO L87 Difference]: Start difference. First operand 500 states and 501 transitions. Second operand 99 states. [2018-10-15 15:34:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:47,774 INFO L93 Difference]: Finished difference Result 516 states and 517 transitions. [2018-10-15 15:34:47,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 15:34:47,774 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 499 [2018-10-15 15:34:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:47,776 INFO L225 Difference]: With dead ends: 516 [2018-10-15 15:34:47,776 INFO L226 Difference]: Without dead ends: 516 [2018-10-15 15:34:47,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 15:34:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-10-15 15:34:47,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 510. [2018-10-15 15:34:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-10-15 15:34:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 511 transitions. [2018-10-15 15:34:47,783 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 511 transitions. Word has length 499 [2018-10-15 15:34:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:47,784 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 511 transitions. [2018-10-15 15:34:47,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:34:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 511 transitions. [2018-10-15 15:34:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-15 15:34:47,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:47,787 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:47,787 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:47,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:47,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1082174566, now seen corresponding path program 49 times [2018-10-15 15:34:47,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11956 backedges. 49 proven. 11907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:50,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:50,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 15:34:50,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 15:34:50,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 15:34:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:34:50,925 INFO L87 Difference]: Start difference. First operand 510 states and 511 transitions. Second operand 101 states. [2018-10-15 15:34:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:56,194 INFO L93 Difference]: Finished difference Result 522 states and 523 transitions. [2018-10-15 15:34:56,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 15:34:56,194 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 509 [2018-10-15 15:34:56,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:56,196 INFO L225 Difference]: With dead ends: 522 [2018-10-15 15:34:56,196 INFO L226 Difference]: Without dead ends: 522 [2018-10-15 15:34:56,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 15:34:56,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-10-15 15:34:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 520. [2018-10-15 15:34:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-15 15:34:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 521 transitions. [2018-10-15 15:34:56,202 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 521 transitions. Word has length 509 [2018-10-15 15:34:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:56,203 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 521 transitions. [2018-10-15 15:34:56,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 15:34:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 521 transitions. [2018-10-15 15:34:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-15 15:34:56,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:56,206 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:56,206 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:56,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1732890095, now seen corresponding path program 50 times [2018-10-15 15:34:56,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 1309 proven. 1 refuted. 0 times theorem prover too weak. 11140 trivial. 0 not checked. [2018-10-15 15:34:56,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:56,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:34:56,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:34:56,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:34:56,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:34:56,777 INFO L87 Difference]: Start difference. First operand 520 states and 521 transitions. Second operand 8 states. [2018-10-15 15:34:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:56,918 INFO L93 Difference]: Finished difference Result 544 states and 547 transitions. [2018-10-15 15:34:56,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 15:34:56,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 519 [2018-10-15 15:34:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:56,922 INFO L225 Difference]: With dead ends: 544 [2018-10-15 15:34:56,922 INFO L226 Difference]: Without dead ends: 544 [2018-10-15 15:34:56,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:34:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-10-15 15:34:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 539. [2018-10-15 15:34:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-15 15:34:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 542 transitions. [2018-10-15 15:34:56,928 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 542 transitions. Word has length 519 [2018-10-15 15:34:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:56,928 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 542 transitions. [2018-10-15 15:34:56,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:34:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 542 transitions. [2018-10-15 15:34:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-10-15 15:34:56,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:56,931 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 51, 50, 50, 50, 50, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:56,931 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:56,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:56,931 INFO L82 PathProgramCache]: Analyzing trace with hash -164251768, now seen corresponding path program 51 times [2018-10-15 15:34:56,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12807 backedges. 1648 proven. 13 refuted. 0 times theorem prover too weak. 11146 trivial. 0 not checked. [2018-10-15 15:34:57,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:57,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:34:57,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:34:57,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:34:57,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:34:57,193 INFO L87 Difference]: Start difference. First operand 539 states and 542 transitions. Second operand 9 states. [2018-10-15 15:34:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:57,331 INFO L93 Difference]: Finished difference Result 545 states and 548 transitions. [2018-10-15 15:34:57,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:34:57,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 529 [2018-10-15 15:34:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:57,336 INFO L225 Difference]: With dead ends: 545 [2018-10-15 15:34:57,336 INFO L226 Difference]: Without dead ends: 545 [2018-10-15 15:34:57,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:34:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-15 15:34:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 543. [2018-10-15 15:34:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-10-15 15:34:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 546 transitions. [2018-10-15 15:34:57,342 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 546 transitions. Word has length 529 [2018-10-15 15:34:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:57,343 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 546 transitions. [2018-10-15 15:34:57,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:34:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 546 transitions. [2018-10-15 15:34:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-10-15 15:34:57,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:57,347 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 50, 50, 50, 50, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:57,347 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:57,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash -937290689, now seen corresponding path program 52 times [2018-10-15 15:34:57,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13174 backedges. 8250 proven. 42 refuted. 0 times theorem prover too weak. 4882 trivial. 0 not checked. [2018-10-15 15:34:58,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:58,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 15:34:58,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 15:34:58,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 15:34:58,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=1314, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 15:34:58,426 INFO L87 Difference]: Start difference. First operand 543 states and 546 transitions. Second operand 42 states. [2018-10-15 15:34:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:59,677 INFO L93 Difference]: Finished difference Result 816 states and 842 transitions. [2018-10-15 15:34:59,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 15:34:59,677 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 539 [2018-10-15 15:34:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:59,683 INFO L225 Difference]: With dead ends: 816 [2018-10-15 15:34:59,684 INFO L226 Difference]: Without dead ends: 816 [2018-10-15 15:34:59,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1956, Invalid=5016, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 15:34:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2018-10-15 15:34:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 756. [2018-10-15 15:34:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2018-10-15 15:34:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 780 transitions. [2018-10-15 15:34:59,701 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 780 transitions. Word has length 539 [2018-10-15 15:34:59,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:59,702 INFO L481 AbstractCegarLoop]: Abstraction has 756 states and 780 transitions. [2018-10-15 15:34:59,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 15:34:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 780 transitions. [2018-10-15 15:34:59,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-10-15 15:34:59,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:59,705 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 53, 50, 50, 50, 50, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:59,705 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:59,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:59,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1027131338, now seen corresponding path program 53 times [2018-10-15 15:34:59,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13551 backedges. 8574 proven. 88 refuted. 0 times theorem prover too weak. 4889 trivial. 0 not checked. [2018-10-15 15:35:01,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:01,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:35:01,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:35:01,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:35:01,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:35:01,035 INFO L87 Difference]: Start difference. First operand 756 states and 780 transitions. Second operand 43 states. [2018-10-15 15:35:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:02,379 INFO L93 Difference]: Finished difference Result 1171 states and 1231 transitions. [2018-10-15 15:35:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 15:35:02,380 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 549 [2018-10-15 15:35:02,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:02,386 INFO L225 Difference]: With dead ends: 1171 [2018-10-15 15:35:02,387 INFO L226 Difference]: Without dead ends: 1171 [2018-10-15 15:35:02,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2017, Invalid=5465, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:35:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2018-10-15 15:35:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 759. [2018-10-15 15:35:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-10-15 15:35:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 783 transitions. [2018-10-15 15:35:02,400 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 783 transitions. Word has length 549 [2018-10-15 15:35:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:02,400 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 783 transitions. [2018-10-15 15:35:02,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:35:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 783 transitions. [2018-10-15 15:35:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 15:35:02,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:02,404 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 54, 50, 50, 50, 50, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:02,404 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:02,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:02,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1615139693, now seen corresponding path program 54 times [2018-10-15 15:35:02,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 13938 backedges. 8891 proven. 151 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2018-10-15 15:35:03,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:03,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 15:35:03,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 15:35:03,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 15:35:03,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1473, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 15:35:03,202 INFO L87 Difference]: Start difference. First operand 759 states and 783 transitions. Second operand 44 states. [2018-10-15 15:35:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:04,999 INFO L93 Difference]: Finished difference Result 1286 states and 1356 transitions. [2018-10-15 15:35:04,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 15:35:04,999 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 559 [2018-10-15 15:35:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:05,005 INFO L225 Difference]: With dead ends: 1286 [2018-10-15 15:35:05,005 INFO L226 Difference]: Without dead ends: 1286 [2018-10-15 15:35:05,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2083, Invalid=5927, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:35:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-10-15 15:35:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 762. [2018-10-15 15:35:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-10-15 15:35:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 786 transitions. [2018-10-15 15:35:05,017 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 786 transitions. Word has length 559 [2018-10-15 15:35:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:05,018 INFO L481 AbstractCegarLoop]: Abstraction has 762 states and 786 transitions. [2018-10-15 15:35:05,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 15:35:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 786 transitions. [2018-10-15 15:35:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-10-15 15:35:05,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:05,022 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 55, 50, 50, 50, 50, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:05,023 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:05,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:05,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1483762204, now seen corresponding path program 55 times [2018-10-15 15:35:05,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 14335 backedges. 9201 proven. 231 refuted. 0 times theorem prover too weak. 4903 trivial. 0 not checked. [2018-10-15 15:35:06,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:06,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:35:06,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:35:06,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:35:06,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1554, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:35:06,092 INFO L87 Difference]: Start difference. First operand 762 states and 786 transitions. Second operand 45 states. [2018-10-15 15:35:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:07,324 INFO L93 Difference]: Finished difference Result 1424 states and 1506 transitions. [2018-10-15 15:35:07,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 15:35:07,325 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 569 [2018-10-15 15:35:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:07,332 INFO L225 Difference]: With dead ends: 1424 [2018-10-15 15:35:07,332 INFO L226 Difference]: Without dead ends: 1424 [2018-10-15 15:35:07,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1804 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2154, Invalid=6402, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:35:07,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2018-10-15 15:35:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 765. [2018-10-15 15:35:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-10-15 15:35:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 789 transitions. [2018-10-15 15:35:07,345 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 789 transitions. Word has length 569 [2018-10-15 15:35:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:07,346 INFO L481 AbstractCegarLoop]: Abstraction has 765 states and 789 transitions. [2018-10-15 15:35:07,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:35:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 789 transitions. [2018-10-15 15:35:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-15 15:35:07,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:07,349 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 56, 50, 50, 50, 50, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:07,350 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:07,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:07,350 INFO L82 PathProgramCache]: Analyzing trace with hash 862891931, now seen corresponding path program 56 times [2018-10-15 15:35:07,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 14742 backedges. 9504 proven. 328 refuted. 0 times theorem prover too weak. 4910 trivial. 0 not checked. [2018-10-15 15:35:08,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:08,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 15:35:08,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 15:35:08,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 15:35:08,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=1636, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 15:35:08,174 INFO L87 Difference]: Start difference. First operand 765 states and 789 transitions. Second operand 46 states. [2018-10-15 15:35:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:09,751 INFO L93 Difference]: Finished difference Result 1585 states and 1681 transitions. [2018-10-15 15:35:09,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 15:35:09,752 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 579 [2018-10-15 15:35:09,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:09,759 INFO L225 Difference]: With dead ends: 1585 [2018-10-15 15:35:09,760 INFO L226 Difference]: Without dead ends: 1585 [2018-10-15 15:35:09,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1981 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2230, Invalid=6890, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 15:35:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2018-10-15 15:35:09,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 768. [2018-10-15 15:35:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-10-15 15:35:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 792 transitions. [2018-10-15 15:35:09,772 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 792 transitions. Word has length 579 [2018-10-15 15:35:09,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:09,773 INFO L481 AbstractCegarLoop]: Abstraction has 768 states and 792 transitions. [2018-10-15 15:35:09,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 15:35:09,773 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 792 transitions. [2018-10-15 15:35:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-10-15 15:35:09,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:09,777 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 57, 50, 50, 50, 50, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:09,777 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:09,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:09,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2038321298, now seen corresponding path program 57 times [2018-10-15 15:35:09,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15159 backedges. 9800 proven. 442 refuted. 0 times theorem prover too weak. 4917 trivial. 0 not checked. [2018-10-15 15:35:10,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:10,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:35:10,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:35:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:35:10,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=1719, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:35:10,852 INFO L87 Difference]: Start difference. First operand 768 states and 792 transitions. Second operand 47 states. [2018-10-15 15:35:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:12,177 INFO L93 Difference]: Finished difference Result 1769 states and 1881 transitions. [2018-10-15 15:35:12,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 15:35:12,177 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 589 [2018-10-15 15:35:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:12,184 INFO L225 Difference]: With dead ends: 1769 [2018-10-15 15:35:12,184 INFO L226 Difference]: Without dead ends: 1769 [2018-10-15 15:35:12,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2164 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2311, Invalid=7391, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:35:12,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2018-10-15 15:35:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 771. [2018-10-15 15:35:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2018-10-15 15:35:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 795 transitions. [2018-10-15 15:35:12,197 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 795 transitions. Word has length 589 [2018-10-15 15:35:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:12,197 INFO L481 AbstractCegarLoop]: Abstraction has 771 states and 795 transitions. [2018-10-15 15:35:12,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:35:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 795 transitions. [2018-10-15 15:35:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-15 15:35:12,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:12,201 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 50, 50, 50, 50, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:12,201 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:12,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1361995977, now seen corresponding path program 58 times [2018-10-15 15:35:12,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 15586 backedges. 10089 proven. 573 refuted. 0 times theorem prover too weak. 4924 trivial. 0 not checked. [2018-10-15 15:35:13,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:13,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 15:35:13,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 15:35:13,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 15:35:13,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1803, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 15:35:13,099 INFO L87 Difference]: Start difference. First operand 771 states and 795 transitions. Second operand 48 states. [2018-10-15 15:35:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:14,535 INFO L93 Difference]: Finished difference Result 1976 states and 2106 transitions. [2018-10-15 15:35:14,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 15:35:14,536 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 599 [2018-10-15 15:35:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:14,543 INFO L225 Difference]: With dead ends: 1976 [2018-10-15 15:35:14,543 INFO L226 Difference]: Without dead ends: 1976 [2018-10-15 15:35:14,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2353 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2397, Invalid=7905, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 15:35:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2018-10-15 15:35:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 774. [2018-10-15 15:35:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2018-10-15 15:35:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 798 transitions. [2018-10-15 15:35:14,553 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 798 transitions. Word has length 599 [2018-10-15 15:35:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:14,553 INFO L481 AbstractCegarLoop]: Abstraction has 774 states and 798 transitions. [2018-10-15 15:35:14,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 15:35:14,553 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 798 transitions. [2018-10-15 15:35:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-10-15 15:35:14,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:14,556 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 59, 50, 50, 50, 50, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:14,556 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:14,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:14,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1161631680, now seen corresponding path program 59 times [2018-10-15 15:35:14,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16023 backedges. 10371 proven. 721 refuted. 0 times theorem prover too weak. 4931 trivial. 0 not checked. [2018-10-15 15:35:15,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:15,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 15:35:15,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 15:35:15,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 15:35:15,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1888, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:35:15,774 INFO L87 Difference]: Start difference. First operand 774 states and 798 transitions. Second operand 49 states. [2018-10-15 15:35:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:17,289 INFO L93 Difference]: Finished difference Result 2204 states and 2354 transitions. [2018-10-15 15:35:17,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 15:35:17,290 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 609 [2018-10-15 15:35:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:17,296 INFO L225 Difference]: With dead ends: 2204 [2018-10-15 15:35:17,296 INFO L226 Difference]: Without dead ends: 2204 [2018-10-15 15:35:17,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2488, Invalid=8432, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:35:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2018-10-15 15:35:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 777. [2018-10-15 15:35:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2018-10-15 15:35:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 801 transitions. [2018-10-15 15:35:17,307 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 801 transitions. Word has length 609 [2018-10-15 15:35:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:17,307 INFO L481 AbstractCegarLoop]: Abstraction has 777 states and 801 transitions. [2018-10-15 15:35:17,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 15:35:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 801 transitions. [2018-10-15 15:35:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-10-15 15:35:17,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:17,310 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 60, 50, 50, 50, 50, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:17,310 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:17,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:17,310 INFO L82 PathProgramCache]: Analyzing trace with hash -430719241, now seen corresponding path program 60 times [2018-10-15 15:35:17,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16470 backedges. 10646 proven. 886 refuted. 0 times theorem prover too weak. 4938 trivial. 0 not checked. [2018-10-15 15:35:18,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:18,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 15:35:18,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 15:35:18,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 15:35:18,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=1974, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 15:35:18,458 INFO L87 Difference]: Start difference. First operand 777 states and 801 transitions. Second operand 50 states. [2018-10-15 15:35:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:20,383 INFO L93 Difference]: Finished difference Result 2463 states and 2636 transitions. [2018-10-15 15:35:20,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 15:35:20,383 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 619 [2018-10-15 15:35:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:20,391 INFO L225 Difference]: With dead ends: 2463 [2018-10-15 15:35:20,391 INFO L226 Difference]: Without dead ends: 2463 [2018-10-15 15:35:20,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2749 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2584, Invalid=8972, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 15:35:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2018-10-15 15:35:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 780. [2018-10-15 15:35:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-10-15 15:35:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 804 transitions. [2018-10-15 15:35:20,404 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 804 transitions. Word has length 619 [2018-10-15 15:35:20,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:20,405 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 804 transitions. [2018-10-15 15:35:20,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 15:35:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 804 transitions. [2018-10-15 15:35:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2018-10-15 15:35:20,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:20,408 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 61, 50, 50, 50, 50, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:20,408 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:20,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:20,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2060246254, now seen corresponding path program 61 times [2018-10-15 15:35:20,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:21,587 INFO L134 CoverageAnalysis]: Checked inductivity of 16927 backedges. 10914 proven. 1068 refuted. 0 times theorem prover too weak. 4945 trivial. 0 not checked. [2018-10-15 15:35:21,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:21,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:35:21,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:35:21,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:35:21,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=2061, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:35:21,589 INFO L87 Difference]: Start difference. First operand 780 states and 804 transitions. Second operand 51 states. [2018-10-15 15:35:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:23,257 INFO L93 Difference]: Finished difference Result 2705 states and 2899 transitions. [2018-10-15 15:35:23,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 15:35:23,257 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 629 [2018-10-15 15:35:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:23,262 INFO L225 Difference]: With dead ends: 2705 [2018-10-15 15:35:23,263 INFO L226 Difference]: Without dead ends: 2705 [2018-10-15 15:35:23,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2956 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2685, Invalid=9525, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:35:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2018-10-15 15:35:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 783. [2018-10-15 15:35:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-10-15 15:35:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 807 transitions. [2018-10-15 15:35:23,278 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 807 transitions. Word has length 629 [2018-10-15 15:35:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:23,278 INFO L481 AbstractCegarLoop]: Abstraction has 783 states and 807 transitions. [2018-10-15 15:35:23,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:35:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 807 transitions. [2018-10-15 15:35:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-15 15:35:23,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:23,283 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 62, 50, 50, 50, 50, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:23,283 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:23,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash 485372453, now seen corresponding path program 62 times [2018-10-15 15:35:23,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 17394 backedges. 11175 proven. 1267 refuted. 0 times theorem prover too weak. 4952 trivial. 0 not checked. [2018-10-15 15:35:24,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:24,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 15:35:24,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 15:35:24,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 15:35:24,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=2149, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 15:35:24,619 INFO L87 Difference]: Start difference. First operand 783 states and 807 transitions. Second operand 52 states. [2018-10-15 15:35:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:26,035 INFO L93 Difference]: Finished difference Result 2930 states and 3143 transitions. [2018-10-15 15:35:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 15:35:26,036 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 639 [2018-10-15 15:35:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:26,039 INFO L225 Difference]: With dead ends: 2930 [2018-10-15 15:35:26,039 INFO L226 Difference]: Without dead ends: 2930 [2018-10-15 15:35:26,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3169 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2791, Invalid=10091, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 15:35:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2018-10-15 15:35:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 786. [2018-10-15 15:35:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2018-10-15 15:35:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 810 transitions. [2018-10-15 15:35:26,053 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 810 transitions. Word has length 639 [2018-10-15 15:35:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:26,053 INFO L481 AbstractCegarLoop]: Abstraction has 786 states and 810 transitions. [2018-10-15 15:35:26,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 15:35:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 810 transitions. [2018-10-15 15:35:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-10-15 15:35:26,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:26,057 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 63, 50, 50, 50, 50, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:26,057 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:26,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:26,057 INFO L82 PathProgramCache]: Analyzing trace with hash 910929564, now seen corresponding path program 63 times [2018-10-15 15:35:26,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 17871 backedges. 11429 proven. 1483 refuted. 0 times theorem prover too weak. 4959 trivial. 0 not checked. [2018-10-15 15:35:27,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:27,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 15:35:27,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 15:35:27,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 15:35:27,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=2238, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:35:27,165 INFO L87 Difference]: Start difference. First operand 786 states and 810 transitions. Second operand 53 states. [2018-10-15 15:35:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:28,766 INFO L93 Difference]: Finished difference Result 3138 states and 3368 transitions. [2018-10-15 15:35:28,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 15:35:28,766 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 649 [2018-10-15 15:35:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:28,770 INFO L225 Difference]: With dead ends: 3138 [2018-10-15 15:35:28,770 INFO L226 Difference]: Without dead ends: 3138 [2018-10-15 15:35:28,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3388 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2902, Invalid=10670, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 15:35:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-10-15 15:35:28,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 789. [2018-10-15 15:35:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-15 15:35:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 813 transitions. [2018-10-15 15:35:28,786 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 813 transitions. Word has length 649 [2018-10-15 15:35:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:28,786 INFO L481 AbstractCegarLoop]: Abstraction has 789 states and 813 transitions. [2018-10-15 15:35:28,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 15:35:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 813 transitions. [2018-10-15 15:35:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-10-15 15:35:28,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:28,791 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 64, 50, 50, 50, 50, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:28,791 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:28,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:28,792 INFO L82 PathProgramCache]: Analyzing trace with hash -62045613, now seen corresponding path program 64 times [2018-10-15 15:35:28,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 18358 backedges. 16543 proven. 1716 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-15 15:35:33,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:33,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-10-15 15:35:33,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-15 15:35:33,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-15 15:35:33,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2838, Invalid=10968, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 15:35:33,062 INFO L87 Difference]: Start difference. First operand 789 states and 813 transitions. Second operand 118 states. [2018-10-15 15:35:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:39,110 INFO L93 Difference]: Finished difference Result 6604 states and 7119 transitions. [2018-10-15 15:35:39,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 15:35:39,115 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 659 [2018-10-15 15:35:39,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:39,124 INFO L225 Difference]: With dead ends: 6604 [2018-10-15 15:35:39,124 INFO L226 Difference]: Without dead ends: 6604 [2018-10-15 15:35:39,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13789 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=15178, Invalid=46078, Unknown=0, NotChecked=0, Total=61256 [2018-10-15 15:35:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6604 states. [2018-10-15 15:35:39,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6604 to 3606. [2018-10-15 15:35:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3606 states. [2018-10-15 15:35:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 3888 transitions. [2018-10-15 15:35:39,176 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 3888 transitions. Word has length 659 [2018-10-15 15:35:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:39,176 INFO L481 AbstractCegarLoop]: Abstraction has 3606 states and 3888 transitions. [2018-10-15 15:35:39,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-15 15:35:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 3888 transitions. [2018-10-15 15:35:39,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-10-15 15:35:39,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:39,181 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 65, 50, 50, 50, 50, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:39,181 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:39,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1221665462, now seen corresponding path program 65 times [2018-10-15 15:35:39,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18855 backedges. 16783 proven. 1966 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-10-15 15:35:43,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:43,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 15:35:43,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 15:35:43,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 15:35:43,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2855, Invalid=11187, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:35:43,701 INFO L87 Difference]: Start difference. First operand 3606 states and 3888 transitions. Second operand 119 states. [2018-10-15 15:35:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:50,677 INFO L93 Difference]: Finished difference Result 22421 states and 24496 transitions. [2018-10-15 15:35:50,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 15:35:50,678 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 669 [2018-10-15 15:35:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:50,700 INFO L225 Difference]: With dead ends: 22421 [2018-10-15 15:35:50,700 INFO L226 Difference]: Without dead ends: 22421 [2018-10-15 15:35:50,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14276 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=15363, Invalid=47387, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 15:35:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22421 states. [2018-10-15 15:35:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22421 to 3609. [2018-10-15 15:35:50,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3609 states. [2018-10-15 15:35:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 3891 transitions. [2018-10-15 15:35:50,852 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 3891 transitions. Word has length 669 [2018-10-15 15:35:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:50,852 INFO L481 AbstractCegarLoop]: Abstraction has 3609 states and 3891 transitions. [2018-10-15 15:35:50,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 15:35:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 3891 transitions. [2018-10-15 15:35:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-10-15 15:35:50,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:50,858 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 66, 50, 50, 50, 50, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:50,858 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:50,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:50,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1224765313, now seen corresponding path program 66 times [2018-10-15 15:35:50,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 19362 backedges. 17016 proven. 2233 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-15 15:35:55,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:55,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-10-15 15:35:55,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-15 15:35:55,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-15 15:35:55,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2873, Invalid=11407, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 15:35:55,334 INFO L87 Difference]: Start difference. First operand 3609 states and 3891 transitions. Second operand 120 states. [2018-10-15 15:36:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:01,921 INFO L93 Difference]: Finished difference Result 24044 states and 26276 transitions. [2018-10-15 15:36:01,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-15 15:36:01,921 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 679 [2018-10-15 15:36:01,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:01,939 INFO L225 Difference]: With dead ends: 24044 [2018-10-15 15:36:01,939 INFO L226 Difference]: Without dead ends: 24044 [2018-10-15 15:36:01,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14769 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=15553, Invalid=48709, Unknown=0, NotChecked=0, Total=64262 [2018-10-15 15:36:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24044 states. [2018-10-15 15:36:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24044 to 3612. [2018-10-15 15:36:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3612 states. [2018-10-15 15:36:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 3894 transitions. [2018-10-15 15:36:02,072 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 3894 transitions. Word has length 679 [2018-10-15 15:36:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:02,073 INFO L481 AbstractCegarLoop]: Abstraction has 3612 states and 3894 transitions. [2018-10-15 15:36:02,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-15 15:36:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 3894 transitions. [2018-10-15 15:36:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-10-15 15:36:02,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:02,078 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 67, 50, 50, 50, 50, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:02,078 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:02,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:02,079 INFO L82 PathProgramCache]: Analyzing trace with hash -190453512, now seen corresponding path program 67 times [2018-10-15 15:36:02,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 19879 backedges. 17242 proven. 2517 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-15 15:36:06,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:06,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 15:36:06,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 15:36:06,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 15:36:06,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2892, Invalid=11628, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 15:36:06,517 INFO L87 Difference]: Start difference. First operand 3612 states and 3894 transitions. Second operand 121 states. [2018-10-15 15:36:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:13,427 INFO L93 Difference]: Finished difference Result 25698 states and 28090 transitions. [2018-10-15 15:36:13,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 15:36:13,427 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 689 [2018-10-15 15:36:13,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:13,446 INFO L225 Difference]: With dead ends: 25698 [2018-10-15 15:36:13,447 INFO L226 Difference]: Without dead ends: 25698 [2018-10-15 15:36:13,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=15748, Invalid=50044, Unknown=0, NotChecked=0, Total=65792 [2018-10-15 15:36:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25698 states. [2018-10-15 15:36:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25698 to 3615. [2018-10-15 15:36:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3615 states. [2018-10-15 15:36:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 3897 transitions. [2018-10-15 15:36:13,565 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 3897 transitions. Word has length 689 [2018-10-15 15:36:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:13,566 INFO L481 AbstractCegarLoop]: Abstraction has 3615 states and 3897 transitions. [2018-10-15 15:36:13,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 15:36:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 3897 transitions. [2018-10-15 15:36:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-15 15:36:13,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:13,570 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 68, 50, 50, 50, 50, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:13,570 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:13,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1691826607, now seen corresponding path program 68 times [2018-10-15 15:36:13,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 20406 backedges. 17461 proven. 2818 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-10-15 15:36:18,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:18,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-10-15 15:36:18,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-15 15:36:18,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-15 15:36:18,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2912, Invalid=11850, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 15:36:18,198 INFO L87 Difference]: Start difference. First operand 3615 states and 3897 transitions. Second operand 122 states. [2018-10-15 15:36:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:25,149 INFO L93 Difference]: Finished difference Result 27375 states and 29929 transitions. [2018-10-15 15:36:25,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-15 15:36:25,149 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 699 [2018-10-15 15:36:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:25,170 INFO L225 Difference]: With dead ends: 27375 [2018-10-15 15:36:25,170 INFO L226 Difference]: Without dead ends: 27375 [2018-10-15 15:36:25,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15773 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=15948, Invalid=51392, Unknown=0, NotChecked=0, Total=67340 [2018-10-15 15:36:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27375 states. [2018-10-15 15:36:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27375 to 3618. [2018-10-15 15:36:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2018-10-15 15:36:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 3900 transitions. [2018-10-15 15:36:25,294 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 3900 transitions. Word has length 699 [2018-10-15 15:36:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:25,295 INFO L481 AbstractCegarLoop]: Abstraction has 3618 states and 3900 transitions. [2018-10-15 15:36:25,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-15 15:36:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 3900 transitions. [2018-10-15 15:36:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2018-10-15 15:36:25,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:25,298 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 69, 50, 50, 50, 50, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:25,298 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:25,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:25,299 INFO L82 PathProgramCache]: Analyzing trace with hash -215985754, now seen corresponding path program 69 times [2018-10-15 15:36:25,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 20943 backedges. 17673 proven. 3136 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-10-15 15:36:30,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:30,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 15:36:30,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 15:36:30,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 15:36:30,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2933, Invalid=12073, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:36:30,006 INFO L87 Difference]: Start difference. First operand 3618 states and 3900 transitions. Second operand 123 states. [2018-10-15 15:36:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:37,112 INFO L93 Difference]: Finished difference Result 29075 states and 31793 transitions. [2018-10-15 15:36:37,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-15 15:36:37,112 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 709 [2018-10-15 15:36:37,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:37,134 INFO L225 Difference]: With dead ends: 29075 [2018-10-15 15:36:37,134 INFO L226 Difference]: Without dead ends: 29075 [2018-10-15 15:36:37,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16284 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=16153, Invalid=52753, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 15:36:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29075 states. [2018-10-15 15:36:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29075 to 3621. [2018-10-15 15:36:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3621 states. [2018-10-15 15:36:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 3903 transitions. [2018-10-15 15:36:37,251 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 3903 transitions. Word has length 709 [2018-10-15 15:36:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:37,251 INFO L481 AbstractCegarLoop]: Abstraction has 3621 states and 3903 transitions. [2018-10-15 15:36:37,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 15:36:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 3903 transitions. [2018-10-15 15:36:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-10-15 15:36:37,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:37,255 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 70, 50, 50, 50, 50, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:37,256 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:37,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:37,256 INFO L82 PathProgramCache]: Analyzing trace with hash 786505949, now seen corresponding path program 70 times [2018-10-15 15:36:37,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 21490 backedges. 17878 proven. 3471 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-10-15 15:36:41,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:41,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-10-15 15:36:41,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-15 15:36:41,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-15 15:36:41,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2955, Invalid=12297, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 15:36:41,894 INFO L87 Difference]: Start difference. First operand 3621 states and 3903 transitions. Second operand 124 states. [2018-10-15 15:36:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:48,692 INFO L93 Difference]: Finished difference Result 30798 states and 33682 transitions. [2018-10-15 15:36:48,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 15:36:48,692 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 719 [2018-10-15 15:36:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:48,714 INFO L225 Difference]: With dead ends: 30798 [2018-10-15 15:36:48,715 INFO L226 Difference]: Without dead ends: 30798 [2018-10-15 15:36:48,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16801 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=16363, Invalid=54127, Unknown=0, NotChecked=0, Total=70490 [2018-10-15 15:36:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30798 states. [2018-10-15 15:36:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30798 to 3624. [2018-10-15 15:36:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3624 states. [2018-10-15 15:36:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 3906 transitions. [2018-10-15 15:36:48,835 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 3906 transitions. Word has length 719 [2018-10-15 15:36:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:48,836 INFO L481 AbstractCegarLoop]: Abstraction has 3624 states and 3906 transitions. [2018-10-15 15:36:48,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-15 15:36:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 3906 transitions. [2018-10-15 15:36:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2018-10-15 15:36:48,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:48,839 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 71, 50, 50, 50, 50, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:48,840 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:48,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:48,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1538418860, now seen corresponding path program 71 times [2018-10-15 15:36:48,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 22047 backedges. 18076 proven. 3823 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-15 15:36:53,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:53,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 15:36:53,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 15:36:53,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 15:36:53,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2978, Invalid=12522, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 15:36:53,617 INFO L87 Difference]: Start difference. First operand 3624 states and 3906 transitions. Second operand 125 states. [2018-10-15 15:37:01,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:01,271 INFO L93 Difference]: Finished difference Result 32544 states and 35596 transitions. [2018-10-15 15:37:01,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-15 15:37:01,272 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 729 [2018-10-15 15:37:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:01,297 INFO L225 Difference]: With dead ends: 32544 [2018-10-15 15:37:01,297 INFO L226 Difference]: Without dead ends: 32544 [2018-10-15 15:37:01,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17324 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=16578, Invalid=55514, Unknown=0, NotChecked=0, Total=72092 [2018-10-15 15:37:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32544 states. [2018-10-15 15:37:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32544 to 3627. [2018-10-15 15:37:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3627 states. [2018-10-15 15:37:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 3627 states and 3909 transitions. [2018-10-15 15:37:01,419 INFO L78 Accepts]: Start accepts. Automaton has 3627 states and 3909 transitions. Word has length 729 [2018-10-15 15:37:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:01,419 INFO L481 AbstractCegarLoop]: Abstraction has 3627 states and 3909 transitions. [2018-10-15 15:37:01,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 15:37:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 3909 transitions. [2018-10-15 15:37:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-10-15 15:37:01,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:01,423 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 72, 50, 50, 50, 50, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:01,423 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:01,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:01,424 INFO L82 PathProgramCache]: Analyzing trace with hash -479353589, now seen corresponding path program 72 times [2018-10-15 15:37:01,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 22614 backedges. 18267 proven. 4192 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-15 15:37:05,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:05,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-10-15 15:37:05,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-15 15:37:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-15 15:37:05,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3002, Invalid=12748, Unknown=0, NotChecked=0, Total=15750 [2018-10-15 15:37:05,966 INFO L87 Difference]: Start difference. First operand 3627 states and 3909 transitions. Second operand 126 states. [2018-10-15 15:37:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:13,937 INFO L93 Difference]: Finished difference Result 34313 states and 37535 transitions. [2018-10-15 15:37:13,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 15:37:13,937 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 739 [2018-10-15 15:37:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:13,961 INFO L225 Difference]: With dead ends: 34313 [2018-10-15 15:37:13,961 INFO L226 Difference]: Without dead ends: 34313 [2018-10-15 15:37:13,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17853 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=16798, Invalid=56914, Unknown=0, NotChecked=0, Total=73712 [2018-10-15 15:37:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34313 states. [2018-10-15 15:37:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34313 to 3630. [2018-10-15 15:37:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3630 states. [2018-10-15 15:37:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 3912 transitions. [2018-10-15 15:37:14,084 INFO L78 Accepts]: Start accepts. Automaton has 3630 states and 3912 transitions. Word has length 739 [2018-10-15 15:37:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:14,084 INFO L481 AbstractCegarLoop]: Abstraction has 3630 states and 3912 transitions. [2018-10-15 15:37:14,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-15 15:37:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3630 states and 3912 transitions. [2018-10-15 15:37:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-10-15 15:37:14,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:14,088 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 73, 50, 50, 50, 50, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:14,088 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:14,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:14,089 INFO L82 PathProgramCache]: Analyzing trace with hash -954385918, now seen corresponding path program 73 times [2018-10-15 15:37:14,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 23191 backedges. 18451 proven. 4578 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-15 15:37:18,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:18,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 15:37:18,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 15:37:18,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 15:37:18,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3027, Invalid=12975, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:37:18,958 INFO L87 Difference]: Start difference. First operand 3630 states and 3912 transitions. Second operand 127 states. [2018-10-15 15:37:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:26,323 INFO L93 Difference]: Finished difference Result 36105 states and 39499 transitions. [2018-10-15 15:37:26,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 15:37:26,323 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 749 [2018-10-15 15:37:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:26,348 INFO L225 Difference]: With dead ends: 36105 [2018-10-15 15:37:26,348 INFO L226 Difference]: Without dead ends: 36105 [2018-10-15 15:37:26,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18388 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=17023, Invalid=58327, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 15:37:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36105 states. [2018-10-15 15:37:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36105 to 3633. [2018-10-15 15:37:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3633 states. [2018-10-15 15:37:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 3915 transitions. [2018-10-15 15:37:26,486 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 3915 transitions. Word has length 749 [2018-10-15 15:37:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:26,486 INFO L481 AbstractCegarLoop]: Abstraction has 3633 states and 3915 transitions. [2018-10-15 15:37:26,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 15:37:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 3915 transitions. [2018-10-15 15:37:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-10-15 15:37:26,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:26,491 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 74, 50, 50, 50, 50, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:26,491 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:26,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:26,491 INFO L82 PathProgramCache]: Analyzing trace with hash -66304455, now seen corresponding path program 74 times [2018-10-15 15:37:26,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 23778 backedges. 18628 proven. 4981 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-10-15 15:37:31,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:31,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-10-15 15:37:31,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-15 15:37:31,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-15 15:37:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3053, Invalid=13203, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 15:37:31,282 INFO L87 Difference]: Start difference. First operand 3633 states and 3915 transitions. Second operand 128 states. [2018-10-15 15:37:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:39,207 INFO L93 Difference]: Finished difference Result 37920 states and 41488 transitions. [2018-10-15 15:37:39,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-15 15:37:39,207 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 759 [2018-10-15 15:37:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:39,233 INFO L225 Difference]: With dead ends: 37920 [2018-10-15 15:37:39,234 INFO L226 Difference]: Without dead ends: 37920 [2018-10-15 15:37:39,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18929 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=17253, Invalid=59753, Unknown=0, NotChecked=0, Total=77006 [2018-10-15 15:37:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37920 states. [2018-10-15 15:37:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37920 to 3636. [2018-10-15 15:37:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3636 states. [2018-10-15 15:37:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 3918 transitions. [2018-10-15 15:37:39,374 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 3918 transitions. Word has length 759 [2018-10-15 15:37:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:39,374 INFO L481 AbstractCegarLoop]: Abstraction has 3636 states and 3918 transitions. [2018-10-15 15:37:39,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-15 15:37:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 3918 transitions. [2018-10-15 15:37:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2018-10-15 15:37:39,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:39,379 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 75, 75, 50, 50, 50, 50, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:39,379 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:39,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash -943801936, now seen corresponding path program 75 times [2018-10-15 15:37:39,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 24375 backedges. 18798 proven. 5401 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-10-15 15:37:44,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:44,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 15:37:44,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 15:37:44,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 15:37:44,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3080, Invalid=13432, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 15:37:44,310 INFO L87 Difference]: Start difference. First operand 3636 states and 3918 transitions. Second operand 129 states. [2018-10-15 15:37:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:52,838 INFO L93 Difference]: Finished difference Result 39756 states and 43500 transitions. [2018-10-15 15:37:52,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-10-15 15:37:52,838 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 769 [2018-10-15 15:37:52,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:52,866 INFO L225 Difference]: With dead ends: 39756 [2018-10-15 15:37:52,866 INFO L226 Difference]: Without dead ends: 39756 [2018-10-15 15:37:52,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19476 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=17488, Invalid=61192, Unknown=0, NotChecked=0, Total=78680 [2018-10-15 15:37:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39756 states. [2018-10-15 15:37:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39756 to 3639. [2018-10-15 15:37:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2018-10-15 15:37:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 3921 transitions. [2018-10-15 15:37:53,010 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 3921 transitions. Word has length 769 [2018-10-15 15:37:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:53,010 INFO L481 AbstractCegarLoop]: Abstraction has 3639 states and 3921 transitions. [2018-10-15 15:37:53,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 15:37:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 3921 transitions. [2018-10-15 15:37:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2018-10-15 15:37:53,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:53,015 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 76, 76, 50, 50, 50, 50, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:53,015 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:53,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:53,015 INFO L82 PathProgramCache]: Analyzing trace with hash 260867175, now seen corresponding path program 76 times [2018-10-15 15:37:53,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 24982 backedges. 18961 proven. 5838 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-15 15:37:57,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:57,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-10-15 15:37:57,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-15 15:37:57,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-15 15:37:57,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3108, Invalid=13662, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 15:37:57,735 INFO L87 Difference]: Start difference. First operand 3639 states and 3921 transitions. Second operand 130 states. [2018-10-15 15:38:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:05,677 INFO L93 Difference]: Finished difference Result 41656 states and 45582 transitions. [2018-10-15 15:38:05,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 15:38:05,677 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 779 [2018-10-15 15:38:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:05,705 INFO L225 Difference]: With dead ends: 41656 [2018-10-15 15:38:05,705 INFO L226 Difference]: Without dead ends: 41656 [2018-10-15 15:38:05,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20029 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=17728, Invalid=62644, Unknown=0, NotChecked=0, Total=80372 [2018-10-15 15:38:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41656 states. [2018-10-15 15:38:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41656 to 3642. [2018-10-15 15:38:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2018-10-15 15:38:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 3924 transitions. [2018-10-15 15:38:05,840 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 3924 transitions. Word has length 779 [2018-10-15 15:38:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:05,841 INFO L481 AbstractCegarLoop]: Abstraction has 3642 states and 3924 transitions. [2018-10-15 15:38:05,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-15 15:38:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 3924 transitions. [2018-10-15 15:38:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2018-10-15 15:38:05,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:05,845 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 77, 77, 50, 50, 50, 50, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:05,845 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:05,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:05,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1616800162, now seen corresponding path program 77 times [2018-10-15 15:38:05,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 25599 backedges. 19117 proven. 6292 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-10-15 15:38:11,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:11,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 15:38:11,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 15:38:11,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 15:38:11,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3137, Invalid=13893, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:38:11,012 INFO L87 Difference]: Start difference. First operand 3642 states and 3924 transitions. Second operand 131 states. [2018-10-15 15:38:19,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:19,408 INFO L93 Difference]: Finished difference Result 43723 states and 47845 transitions. [2018-10-15 15:38:19,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-15 15:38:19,409 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 789 [2018-10-15 15:38:19,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:19,437 INFO L225 Difference]: With dead ends: 43723 [2018-10-15 15:38:19,437 INFO L226 Difference]: Without dead ends: 43723 [2018-10-15 15:38:19,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20588 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=17973, Invalid=64109, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 15:38:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43723 states. [2018-10-15 15:38:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43723 to 3645. [2018-10-15 15:38:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3645 states. [2018-10-15 15:38:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 3927 transitions. [2018-10-15 15:38:19,576 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 3927 transitions. Word has length 789 [2018-10-15 15:38:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:19,576 INFO L481 AbstractCegarLoop]: Abstraction has 3645 states and 3927 transitions. [2018-10-15 15:38:19,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 15:38:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 3927 transitions. [2018-10-15 15:38:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2018-10-15 15:38:19,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:19,581 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 78, 78, 50, 50, 50, 50, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:19,581 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:19,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:19,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1308762219, now seen corresponding path program 78 times [2018-10-15 15:38:19,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 26226 backedges. 19266 proven. 6763 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-10-15 15:38:24,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:24,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-10-15 15:38:24,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-15 15:38:24,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-15 15:38:24,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3167, Invalid=14125, Unknown=0, NotChecked=0, Total=17292 [2018-10-15 15:38:24,695 INFO L87 Difference]: Start difference. First operand 3645 states and 3927 transitions. Second operand 132 states. [2018-10-15 15:38:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:33,078 INFO L93 Difference]: Finished difference Result 46061 states and 50401 transitions. [2018-10-15 15:38:33,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-10-15 15:38:33,079 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 799 [2018-10-15 15:38:33,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:33,108 INFO L225 Difference]: With dead ends: 46061 [2018-10-15 15:38:33,108 INFO L226 Difference]: Without dead ends: 46061 [2018-10-15 15:38:33,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21153 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=18223, Invalid=65587, Unknown=0, NotChecked=0, Total=83810 [2018-10-15 15:38:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46061 states. [2018-10-15 15:38:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46061 to 3648. [2018-10-15 15:38:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3648 states. [2018-10-15 15:38:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 3930 transitions. [2018-10-15 15:38:33,251 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 3930 transitions. Word has length 799 [2018-10-15 15:38:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:33,252 INFO L481 AbstractCegarLoop]: Abstraction has 3648 states and 3930 transitions. [2018-10-15 15:38:33,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-15 15:38:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 3930 transitions. [2018-10-15 15:38:33,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2018-10-15 15:38:33,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:33,256 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 79, 79, 50, 50, 50, 50, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:33,256 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:33,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:33,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1250602996, now seen corresponding path program 79 times [2018-10-15 15:38:33,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 26863 backedges. 19408 proven. 7251 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-10-15 15:38:38,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:38,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 15:38:38,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 15:38:38,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 15:38:38,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3198, Invalid=14358, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 15:38:38,490 INFO L87 Difference]: Start difference. First operand 3648 states and 3930 transitions. Second operand 133 states. [2018-10-15 15:38:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:47,060 INFO L93 Difference]: Finished difference Result 48774 states and 53362 transitions. [2018-10-15 15:38:47,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 15:38:47,060 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 809 [2018-10-15 15:38:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:47,096 INFO L225 Difference]: With dead ends: 48774 [2018-10-15 15:38:47,096 INFO L226 Difference]: Without dead ends: 48774 [2018-10-15 15:38:47,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21724 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=18478, Invalid=67078, Unknown=0, NotChecked=0, Total=85556 [2018-10-15 15:38:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48774 states. [2018-10-15 15:38:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48774 to 3651. [2018-10-15 15:38:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3651 states. [2018-10-15 15:38:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 3933 transitions. [2018-10-15 15:38:47,268 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 3933 transitions. Word has length 809 [2018-10-15 15:38:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:47,268 INFO L481 AbstractCegarLoop]: Abstraction has 3651 states and 3933 transitions. [2018-10-15 15:38:47,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 15:38:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 3933 transitions. [2018-10-15 15:38:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-10-15 15:38:47,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:47,273 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 80, 80, 50, 50, 50, 50, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:47,273 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:47,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:47,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1420810179, now seen corresponding path program 80 times [2018-10-15 15:38:47,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 27510 backedges. 19543 proven. 7756 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-10-15 15:38:52,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:52,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-10-15 15:38:52,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-15 15:38:52,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-15 15:38:52,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3230, Invalid=14592, Unknown=0, NotChecked=0, Total=17822 [2018-10-15 15:38:52,546 INFO L87 Difference]: Start difference. First operand 3651 states and 3933 transitions. Second operand 134 states. [2018-10-15 15:39:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:02,090 INFO L93 Difference]: Finished difference Result 51966 states and 56840 transitions. [2018-10-15 15:39:02,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-15 15:39:02,091 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 819 [2018-10-15 15:39:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:02,128 INFO L225 Difference]: With dead ends: 51966 [2018-10-15 15:39:02,128 INFO L226 Difference]: Without dead ends: 51966 [2018-10-15 15:39:02,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22301 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=18738, Invalid=68582, Unknown=0, NotChecked=0, Total=87320 [2018-10-15 15:39:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51966 states. [2018-10-15 15:39:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51966 to 3654. [2018-10-15 15:39:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3654 states. [2018-10-15 15:39:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 3936 transitions. [2018-10-15 15:39:02,391 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 3936 transitions. Word has length 819 [2018-10-15 15:39:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:02,391 INFO L481 AbstractCegarLoop]: Abstraction has 3654 states and 3936 transitions. [2018-10-15 15:39:02,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-15 15:39:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 3936 transitions. [2018-10-15 15:39:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2018-10-15 15:39:02,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:02,397 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 81, 81, 50, 50, 50, 50, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:02,397 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:02,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:02,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1121360198, now seen corresponding path program 81 times [2018-10-15 15:39:02,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 28167 backedges. 19671 proven. 8278 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-10-15 15:39:07,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:07,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 15:39:07,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 15:39:07,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 15:39:07,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3263, Invalid=14827, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:39:07,823 INFO L87 Difference]: Start difference. First operand 3654 states and 3936 transitions. Second operand 135 states. [2018-10-15 15:39:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:17,570 INFO L93 Difference]: Finished difference Result 55741 states and 60947 transitions. [2018-10-15 15:39:17,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-10-15 15:39:17,570 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 829 [2018-10-15 15:39:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:17,610 INFO L225 Difference]: With dead ends: 55741 [2018-10-15 15:39:17,610 INFO L226 Difference]: Without dead ends: 55741 [2018-10-15 15:39:17,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22884 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=19003, Invalid=70099, Unknown=0, NotChecked=0, Total=89102 [2018-10-15 15:39:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55741 states. [2018-10-15 15:39:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55741 to 3657. [2018-10-15 15:39:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-10-15 15:39:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 3939 transitions. [2018-10-15 15:39:17,786 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 3939 transitions. Word has length 829 [2018-10-15 15:39:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:17,786 INFO L481 AbstractCegarLoop]: Abstraction has 3657 states and 3939 transitions. [2018-10-15 15:39:17,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 15:39:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 3939 transitions. [2018-10-15 15:39:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2018-10-15 15:39:17,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:17,791 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 82, 82, 50, 50, 50, 50, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:17,791 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:17,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:17,792 INFO L82 PathProgramCache]: Analyzing trace with hash 640806129, now seen corresponding path program 82 times [2018-10-15 15:39:17,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 28834 backedges. 19792 proven. 8817 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-10-15 15:39:23,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:23,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-10-15 15:39:23,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-15 15:39:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-15 15:39:23,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3297, Invalid=15063, Unknown=0, NotChecked=0, Total=18360 [2018-10-15 15:39:23,311 INFO L87 Difference]: Start difference. First operand 3657 states and 3939 transitions. Second operand 136 states. [2018-10-15 15:39:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:32,762 INFO L93 Difference]: Finished difference Result 60012 states and 65589 transitions. [2018-10-15 15:39:32,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 15:39:32,763 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 839 [2018-10-15 15:39:32,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:32,798 INFO L225 Difference]: With dead ends: 60012 [2018-10-15 15:39:32,799 INFO L226 Difference]: Without dead ends: 60012 [2018-10-15 15:39:32,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23473 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=19273, Invalid=71629, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 15:39:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60012 states. [2018-10-15 15:39:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60012 to 3653. [2018-10-15 15:39:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3653 states. [2018-10-15 15:39:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 3934 transitions. [2018-10-15 15:39:32,970 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 3934 transitions. Word has length 839 [2018-10-15 15:39:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:32,970 INFO L481 AbstractCegarLoop]: Abstraction has 3653 states and 3934 transitions. [2018-10-15 15:39:32,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-15 15:39:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 3934 transitions. [2018-10-15 15:39:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2018-10-15 15:39:32,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:32,975 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 83, 83, 50, 50, 50, 50, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:32,975 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:32,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:32,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1746052504, now seen corresponding path program 83 times [2018-10-15 15:39:32,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 29511 backedges. 19906 proven. 9373 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-10-15 15:39:38,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:38,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 15:39:38,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 15:39:38,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 15:39:38,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3332, Invalid=15300, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 15:39:38,538 INFO L87 Difference]: Start difference. First operand 3653 states and 3934 transitions. Second operand 137 states. [2018-10-15 15:39:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:47,745 INFO L93 Difference]: Finished difference Result 64140 states and 70068 transitions. [2018-10-15 15:39:47,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-15 15:39:47,749 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 849 [2018-10-15 15:39:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:47,795 INFO L225 Difference]: With dead ends: 64140 [2018-10-15 15:39:47,795 INFO L226 Difference]: Without dead ends: 64140 [2018-10-15 15:39:47,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24068 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=19548, Invalid=73172, Unknown=0, NotChecked=0, Total=92720 [2018-10-15 15:39:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64140 states. [2018-10-15 15:39:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64140 to 3646. [2018-10-15 15:39:47,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3646 states. [2018-10-15 15:39:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 3926 transitions. [2018-10-15 15:39:48,001 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 3926 transitions. Word has length 849 [2018-10-15 15:39:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:48,002 INFO L481 AbstractCegarLoop]: Abstraction has 3646 states and 3926 transitions. [2018-10-15 15:39:48,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 15:39:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 3926 transitions. [2018-10-15 15:39:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 860 [2018-10-15 15:39:48,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:48,008 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 84, 84, 50, 50, 50, 50, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:48,008 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:48,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash -229400801, now seen corresponding path program 84 times [2018-10-15 15:39:48,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 30198 backedges. 20013 proven. 9946 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2018-10-15 15:39:53,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:53,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-10-15 15:39:53,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-15 15:39:53,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-15 15:39:53,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3368, Invalid=15538, Unknown=0, NotChecked=0, Total=18906 [2018-10-15 15:39:53,774 INFO L87 Difference]: Start difference. First operand 3646 states and 3926 transitions. Second operand 138 states. [2018-10-15 15:40:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:03,075 INFO L93 Difference]: Finished difference Result 68183 states and 74458 transitions. [2018-10-15 15:40:03,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2018-10-15 15:40:03,075 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 859 [2018-10-15 15:40:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:03,124 INFO L225 Difference]: With dead ends: 68183 [2018-10-15 15:40:03,124 INFO L226 Difference]: Without dead ends: 68183 [2018-10-15 15:40:03,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24669 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=19828, Invalid=74728, Unknown=0, NotChecked=0, Total=94556 [2018-10-15 15:40:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68183 states. [2018-10-15 15:40:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68183 to 3639. [2018-10-15 15:40:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2018-10-15 15:40:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 3918 transitions. [2018-10-15 15:40:03,342 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 3918 transitions. Word has length 859 [2018-10-15 15:40:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:03,342 INFO L481 AbstractCegarLoop]: Abstraction has 3639 states and 3918 transitions. [2018-10-15 15:40:03,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-15 15:40:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 3918 transitions. [2018-10-15 15:40:03,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2018-10-15 15:40:03,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:03,348 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 85, 85, 50, 50, 50, 50, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:03,348 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:03,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:03,348 INFO L82 PathProgramCache]: Analyzing trace with hash 875604758, now seen corresponding path program 85 times [2018-10-15 15:40:03,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 30895 backedges. 20113 proven. 10536 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-15 15:40:09,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:09,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 15:40:09,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 15:40:09,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 15:40:09,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=15777, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:40:09,140 INFO L87 Difference]: Start difference. First operand 3639 states and 3918 transitions. Second operand 139 states. [2018-10-15 15:40:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:18,583 INFO L93 Difference]: Finished difference Result 72192 states and 78810 transitions. [2018-10-15 15:40:18,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-10-15 15:40:18,584 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 869 [2018-10-15 15:40:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:18,634 INFO L225 Difference]: With dead ends: 72192 [2018-10-15 15:40:18,635 INFO L226 Difference]: Without dead ends: 72192 [2018-10-15 15:40:18,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25276 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=20113, Invalid=76297, Unknown=0, NotChecked=0, Total=96410 [2018-10-15 15:40:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72192 states. [2018-10-15 15:40:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72192 to 3632. [2018-10-15 15:40:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3632 states. [2018-10-15 15:40:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 3910 transitions. [2018-10-15 15:40:18,855 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 3910 transitions. Word has length 869 [2018-10-15 15:40:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:18,856 INFO L481 AbstractCegarLoop]: Abstraction has 3632 states and 3910 transitions. [2018-10-15 15:40:18,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 15:40:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 3910 transitions. [2018-10-15 15:40:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-10-15 15:40:18,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:18,862 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 86, 86, 50, 50, 50, 50, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:18,863 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:18,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash 35941965, now seen corresponding path program 86 times [2018-10-15 15:40:18,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 31602 backedges. 20206 proven. 11143 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-15 15:40:24,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:24,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-10-15 15:40:24,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-15 15:40:24,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-15 15:40:24,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3443, Invalid=16017, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 15:40:24,667 INFO L87 Difference]: Start difference. First operand 3632 states and 3910 transitions. Second operand 140 states.